Presence Of Deadlines Research Articles

Rush to Charge, Dead to Drive: Application of Deadline Rush Model to Electric Vehicle User's Charging Behavior.

This work aims to estimate the portion of electric vehicle (EV) users who exhibit procrastination-like behavior, almost equivalent to an "empty" battery, before they decide to charge their vehicles. There is a human tendency to procrastinate when a deadline approaches. Human behavior in the presence of deadlines has been studied in different fields to evaluate individuals' performance or organizational efficiency and effectiveness. However, this phenomenon has not been investigated among EV users. This study explores users' procrastination-like behavior among 69 Rhode Island public charging stations' data representing 70,611 charging events. The Deadline Rush Model is incorporated to model frequent users' charging profiles. To conduct a robust estimation, the Bayesian Mixture Model is implemented. With the selection of an informative prior, the Bayesian Mixture Model estimated that almost one-third of frequent users procrastinate charging. The majority of procrastination-like users have small battery sizes. Although procrastination-like users need to charge when they arrive at a location, that might not necessarily be true for a plug-in hybrid; thus, systematically, they can clog the system for other users whose needs are more pressing. Understanding unique and unexplored charging behaviors among EV users is beneficial to EV infrastructure stakeholders in reducing the adoption threshold by providing a reliable and ubiquitous charging network. The findings identify a different kind of demand on the EV infrastructure than previously modeled and can directly influence future decision-making criteria in terms of planning to optimize to accommodate EV drivers with different charging behaviors.

Procrastination, self-imposed deadlines and other commitment devices

In this paper we model a decision maker who must exert costly effort to complete a single task by a fixed deadline. Effort costs evolve stochastically in continuous time. The decision maker optimally waits to exert effort until costs are less than a given threshold, the solution to an optimal stopping time problem. We derive the solution to this model for three cases: (1) exponential decision makers, (2) Naïve hyperbolic discounters and (3) sophisticated hyperbolic discounters. Absent deadlines, we show that sophisticated hyperbolic decision makers behave as if they were time consistent but instead have a smaller reward for completing the task, while naïfs never complete the task. In the presence of deadlines, sophisticated decision makers may, counterintuitively, have a threshold which is decreasing as they approach the deadline. An extensive numerical study shows that, unlike exponential or naïfs who always prefer longer deadlines, sophisticated decision makers will often self-impose a binding deadline as a form of commitment, while naïve decision makers will not, and we show how this varies with changes in underlying cost, preference and self-control parameters.

Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines

We address the single-machine batch scheduling problem with the objective of minimizing the total setup cost. This problem arises when there are n jobs that are partitioned into F families and when setup operations are required whenever the machine switches from processing a job of one family to processing a job of another family. We assume that setups do not require time but are associated with a fixed cost which is identical for all setup operations. Each job has a processing time and an associated deadline. The objective is to schedule all jobs such that they are on time with respect to their deadlines and the total setup cost is minimized. We show that the decision version of this problem is NP-complete in the strong sense. Furthermore, we present properties of optimal solutions and an $$O(n\log n+nF)$$ algorithm that approximates the cost of an optimal schedule by a factor of F. The algorithm is analyzed in computational tests.

The effects of group size and task complexity on deadline reactivity

In contemporary organizations, people are often required to work and learn under increasing time pressures as organizations set deadlines in order to respond to stiffer competition. Human behavioral patterns in the presence of deadlines have been studied quantitatively to show that relatively little time is devoted to tasks early on and that most work is performed in close time proximity to a deadline. This phenomenon, called deadline rush, can be explained by a hyperbolic behavioral model. By employing a decision-making task based on an Anti-Air Warfare Coordinator (AAWC) simulator, the experiment had two group size levels (individuals and teams) and two task complexity levels (low and high). The experimental results showed that deadline reactivity is greater for individuals than teams on low-complexity tasks and task complexity is negatively related to deadline reactivity. The results of this study suggest that different group sizes and task types have a significant impact on production performance and that the setting of deadlines, to the degree possible, may be a relevant means towards managing or improving system performance.

Real-Time Computation: A Formal Definition And Its Applications

The concept of real time has different meanings in the systems and theory communities. Thus, the existing formal real-time models do not capture all the practically relevant aspects of such computations. This paper proposes a new definition that, we believe, allows a unified treatment of all practically meaningful variants of real-time computations. We use the developed formalism to mode two important features of real-time algorithms, namely the presence of deadlines and the real-time arrival of input data. We also emphasize the expressive power of our model by using it to formalize aspects from the areas of real-time database systems and ad hoc networks. We offer formulations of the recognition problem for real-time database systems and of the routing problem in ad hoc networks. Finally, we suggest a variant of our formalism that is suited for modelling parallel distributed real-time algorithms. We believe that the proposed formalism is a first step towards a unified and realistic complexity theory for real-time parallel computations.

Single machine scheduling with release times, deadlines and tardiness objectives

A polynomial time algorithm is developed to minimize maximum tardiness on a single machine in the presence of deadlines. The possibility of extending the total tardiness pseudopolynomial algorithm to the cases where release times or deadlines are in place is also investigated. It is concluded that the aforementioned pseudopolynomial algorithm can be extended only when deadlines and due dates are compatible and all job release times are equal.

Study of various TDMA schemes for wireless networks in the presence of deadlines and overhead

The objective of this paper is to determine the minimum system dropping rate (or, equivalently, dropping probability) induced by time division multiple access (TDMA) schemes supporting time-constrained applications with common maximum cell delay tolerance. Expressions are derived for the induced system dropping rate for various TDMA schemes with different overhead and the maximum number of users than can be admitted in the network without violating the maximum dropping rate constraint is determined. The system dropping rate achieved by suboptimal TDMA schemes is compared against the optimal (although ideal) TDMA scheme performance. The performance limiting factors associated with the suboptimal schemes are identified, and the magnitude of their (negative) impact is evaluated. Based on this information it is possible to point to performance improving modifications which should be pursued to the extent permitted by technological constraints. Finally, based on this derivations a network designer may choose the best TDMA scheme-among realizable variations of those considered here-to use in a particular situation.

Understanding Dispute Resolution Processes for American and Australian Public Wildlands: Towards a Conceptual Framework for Managers

/ The last 20 years have seen the successful application of environmental dispute resolution processes, where people voluntarily negotiate toward mutually acceptable solutions, to many environmental disputes. The effects of contextual influences, such as the number of parties and presence of deadlines, on outcomes are known and frequently described. Less well documented and understood are the interaction processes themselves. This paper draws on two case studies to develop a conceptual framework describing these processes. Disputes associated with management planning for the Bob Marshall Wilderness Complex in the United States and Fitzgerald River National Park in Australia provided the cases. The conceptual framework derived had eight sequential stages: (1) joint definition of problems, (2) uncertainty about what to do, (3) agreement on group procedures, (4) realization of interdependence, (5) enthusiasm about collective possibilities, (6) commitment to working together, (7) consolidation of the group, and (8) implementation of a resolution. The framework provides new insights for managers of public wildlands, especially the need for varying but ongoing managerial involvement in dispute resolution processes. High levels of involvement and influence are essential at the beginning in problem definition and group procedure design and at the end in implementing resolutions. Conversely, agency members must be willing to exert less influence, while still being involved and committed to collective purposes, during the middle stages. Also apparent from the conceptual framework is the importance of developing shared understandings and of allowing sufficient time for understanding to develop, if successful resolution is to be achieved. KEY WORDS: Environmental dispute resolution; Conceptual framework; Public wildlands; Shared understandings; Australia

Attributions, Deadlines, and Children's Intrinsic Motivation

Abstract This study assessed the effects of attribution statements and temporal deadlines on preschoolers' intrinsic interest in puzzles. During a training phase, 39 Ss completed puzzles under either the presence or absence of deadlines (instructions “to beat the timer”). They also heard E make either relevant attributions (“I'll bet you like puzzles”) or irrelevant attributions after they solved each puzzle. The two major findings of this study run counter to attribution theory expectations. First, given the presence of deadlines, relevant attributions resulted in less subsequent intrinsic interest as compared to irrelevant attributions. Second, in the presence of irrelevant attributions, deadlines resulted in greater task interest when compared with no deadlines. It appears that, like rewards, deadlines may enhance task interest if they serve to engender self-perceptions of competence. Alternatively, it is conceivable that deadlines can enhance interest by their endogeneity to a task, or by providing proximal goals.

Solving the resource constrained deadline scheduling problem via reduction to the network flow problem

In this paper the problem of the equivalence of scheduling tasks on processors with the presence of deadlines and additional resources and the network flow problem is studied. This equivalence permits it to be proven that the problem of finding a maximal flow in a binary network with multipliers equal to 1 or 2 is NP-complete.

A mathematical programming approach to the scheduling of sorting operations

AbstractIn this paper we describe an approach to the scheduling and/or real‐time control of sorting operations in the presence of deadlines. The problem arises in the postal service where mail has to be sorted by zip codes, and in the banking system where checks have to be sorted according to the bank on which they are drawn. In both applications losses are incurred if items miss their clearing deadlines. For example, in check‐sorting an extremely important objective of the control system is to reduce the “float” i.e., the total dollar value of the checks which miss their deadlines. The proposed real‐time control system utilizes a linear program which chooses between alternative sort‐patterns and assigns the various processing steps to the time periods between deadlines.