M.R. Garey, R.E. Tarjan, G.T. Wilfong (1988). One-processor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Research 13, 330--348. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The continuous assignment problem and its application to.. - Sourd (2002) (Correct)
....completing before T . Let P be the sum of the durations of all the sequenced tasks. For t P , let #(t) be the minimum cost for scheduling the k sequenced tasks so that they complete before time t. The function # : P, T ] R can be computed in O(k log k) by using the algorithm of Garey et al. [9]. We once again refer to [22] for more details. # is a convex nonincreasing function. Moreover, it is piecewise linear with O(k) segments. # is constant after some value of t, # is then equal to the cost of scheduling the sequence of k tasks without makespan constraint. A lower bound taking into ....
M.R. Garey, R.E. Tarjan, and G.T. Wilfong. One-processor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Research, 13:330--348, 1988.
Scheduling a Sequence of Tasks With General Completion Costs - Sourd (2002) (Correct)
....as possible when its predecessor in the sequence is completed. The pure earliness tardiness case (without idle time penalties) can be formulated as a linear program [4] but this problem can be more e#ciently solved in O(n log n) time by a direct algorithm based on the blocks of adjacent tasks [5, 3, 10]. Chretienne and Sourd [2] presented a generalization of this algorithm when the cost functions are convex and when the order between the tasks is only partial, that is given by an arbitrary acyclic precedence graph between the tasks. When the minimization criterion is the maximum cost instead of ....
M.R. Garey, R.E. Tarjan, and G.T. Wilfong, One-processor scheduling with symmetric earliness and tardiness penalties, Mathematics of Operations Research 13 (1988), 330--348.
Meaningless Statements - Roberts (Correct)
....times, where the weighting factor is the priority. The scheduling problem we shall study is to find a schedule that minimizes the penalty. There is a large literature concerned with this problem. For example, if h e (w) h t (w) for all w and f(C, d) C d and c = 1, Garey, Tarjan and Wilfong [8] showed that the problem is NP complete if transportation times can vary, but solvable in polynomial time if they are constant as in our problem. Some survey papers that deal with penalty functions similar to the ones we have described are [1, 2, 11] Suppose that priorities are measured on some ....
Garey, M.R., Tarjan, R.E., and Wilfong, G.T., "One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties," Mathematics of Operations Research, 13 (1988), 330-348.
Effective Local Search Algorithms for the Vehicle.. - Ibaraki, Kubo.. (2002) (1 citation) (Correct)
....can be evaluated in O( P k2M 0 k ) time from the information of the current solution, where M 0 is the set of indices of vehicles which the neighborhood operation involves. Special cases of convex penalty functions were considered in the literature of VRPSTW and scheduling problems, e.g. [7, 11, 14, 26]. In [26] the time penalty for each customer is 1 for earliness and linear for tardiness, and an O(1) time algorithm to approximately compute the optimal time penalty of a solution in the neighborhood was proposed. In [7, 14] the time penalty is linear for both of earliness and tardiness, and ....
....If the penalty function for each customer is the absolute deviation from a speci ed time, this problem becomes the isotonic median regression problem, which has been extensively studied. To the best of our knowledge, the best time complexity for this problem (for a vehicle k) is O(n k log n k ) [2, 11]. The essential part of VRPGTW, i.e. assigning customers to vehicles and determining the visiting order of each vehicle, is solved by local search (LS) algorithms. In the literature, three types of neighborhoods, called the cross exchange, 2 opt and Or opt neighborhoods, have been widely used ....
M.R. Garey, R.E. Tarjan and G.T. Wilfong, \One-processor scheduling with symmetric earliness and tardiness penalties," Mathematics of Operations Research, 13 (1988) 330-348.
PERT scheduling with convex cost functions - Chrétienne, Sourd (2000) (1 citation) (Correct)
....special algorithm for precedence trees do not have to maintain the s ij values. 6.3 Chains of operations We can assume without loss of generality there is only one chain of precedences. If there are several chains, they can be scheduled separately. This problem has been rather widely studied. In [4], an O(n log n) algorithm has been designed for the special case of a common earliness and tardiness penalty coe cient. In [3] an O(n log n) has been designed for the special case when the penalty coe cients are assymetric and task independent. Finally An O(nm) algorithm, where m is the number ....
M.R. Garey, R.E. Tarjan, and G.T. Wilfong, One-processor scheduling with symmetric earliness and tardiness penalties, Mathematics of Operations Research 13 (1988), 330348.
On the Existence of Schedules that are Near-Optimal for both.. - Stein, Wein (1997) (11 citations) (Correct)
....for two (or more) criteria that are Pareto optimal , which means that no schedules exist that are superior simultaneously in both criteria to any schedule in S. Notable results of this sort are due to Van Wassenhove and Gelders [23] Nelson, Sarin and Daniels [20] Garey, Tarjan and Wilfong [6], McCormick and Pinedo [19] Hoogeveen [10, 11] Hoogeveen and Van de Velde [12] Until quite recently there was essentially nothing in the way of general algorithmic techniques for bicriteria scheduling, or results about the quality of approximation that might be obtained simultaneously. ....
M. R. Garey, R.E. Tarjan, and G. T. Wilfong. One-processor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Research, 13:330--348, 1988.
Generation: Minimax Objective Functions, - Release Dates Deadlines (2005) (Correct)
No context found.
M.R. Garey, R.E. Tarjan, G.T. Wilfong (1988). One-processor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Research 13, 330--348.
Universidade Federal de Minas Gerais - Instituto De Cincias (Correct)
No context found.
M.R. Garey, R.E. Tarjan, G.T. Wilfong, One-processor scheduling with symmetric earliness and tardiness penalties, Mathematics of Operations Research 13 (1988) 330-348.
New Directions in Machine Scheduling - Uthaisombut (2000) (Correct)
No context found.
M.R. Garey, R.E. Tarjan, and G.T. Wilfong. One-processor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Research, 13:330-348, 1988.
Algorithm, Implementation, and Feasibility Analysis - Jinggang Wang Virginia (Correct)
No context found.
M. R. Garey, R. E. Tarjan, and G. T. Wilfong, "One-processor scheduling with symmetric earliness and tardiness penalties," Math. Oper. Res., vol. 13, no. 2, pp. 330--348, May 1988.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC