An improved earliness-tardiness timing algorithm

Computers and Operations Research

Volumn 34, Issue 10, 2007, Pages 2931-2938

  Hendel, Yann ^a   Sourd, Francis ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Earliness tardiness; Scheduling; Timing algorithm

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; SCHEDULING;

EARLINESS-TARDINESS; ONE-MACHINE TIMING PROBLEM; TIMING ALGORITHM;

ALGORITHMS;

EID: 33847626621     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.11.004     Document Type: Article

References (17)

1. James RJW., and Buchanan JT. A neighborhood scheme with a compressed solution space for the early/tardy scheduling problem. European Journal of Operational Research 102 (1997) 513-527
2. Wan G., and Yen B.P.C. Tabu search for single machine with distinct due windows and weighted earliness/tardiness penalties. European Journal of Operational Research 142 (2002) 271-281
3. Hendel Y, Sourd F. Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem, European Journal of Operational Research, in press.
4. Garey M.R., Tarjan R.E., and Wilfong G.T. One processor scheduling with symmetrical earliness and tardiness penalties. Mathematics of Operations Research 13 (1988) 330-348
5. Szwarc W., and Mukhopadhyay S.K. Optimal timing schedules in earliness-tardiness single machine sequencing. Naval Research Logistics 42 (1995) 1109-1114
6. Davis J.S., and Kanet J.J. Single-machine scheduling with early and tardy completion costs. Naval Research Logistics 40 (1993) 85-101
7. Bauman J, Jozefowska J. Minimizing the earliness-tardiness costs on a single machine. Computers and Operations Research 2005, in press.
8. Pan Y, Shi L. Dual constrained single machine sequencing to minimize total weighted completion time. IEEE Transactions on Automation Science and Engineering 2005; 2(4): 344-357.
9. Della Croce F., and Trubian M. Optimal idle time insertion in early-tardy parallel machines scheduling with precedence constraints. Production Planning and Control 13 (2002) 133-142
10. Vanhoucke M., Demeulemeester E., and Herroelen W. An exact procedure for the resource-constrained weighted earliness-tardiness project scheduling problem. Annals of Operations Research 102 (2001) 179-196
11. Chrétienne Ph., and Sourd F. PERT scheduling with convex cost functions. Theoretical Computer Science 292 (2002) 145-164
12. Sourd F. Optimal timing of a sequence of tasks with general completion costs. European Journal of Operational Research 165 (2002) 82-96
13. Colin E.C., and Quinino R.C. An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions. Computers and Operations Research 32 (2005) 2285-2296
14. Ahuja R.K., and Orlin J.B. A fast scaling algorithm for minimizing separable convex functions subject to chain constraints. Operations Research 49 (2001) 784-789
15. Chakravarti N. Isotonic median regression: a linear programming approach. Mathematics of Operations Research 14 (1989) 303-308
16. Tarjan R.E. Data structure and networks algorithms (1983), SIAM, Philadelphia, PA [chapter 3]
17. Knuth D. The art of computer programming. Sorting and searching, vol. 3. Reading, MA: Addison-Wesley; 1973.