Minimizing the earliness-tardiness costs on a single machine

Computers and Operations Research

Volumn 33, Issue 11, 2006, Pages 3219-3230

  Bauman, Jakub ^a   Józefowska, Joanna ^b  

^a Baj soft   (Poland)

^b POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Earliness tardiness costs; Just in time; Scheduling; Single machine

Indexed keywords

ALGORITHMS; PROBLEM SOLVING;

EARLINESS-TARDINESS COSTS; JUST-IN-TIME; SINGLE MACHINE;

SCHEDULING;

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

References (10)

1. R.W. Conway, W.L. Maxwell, and L.W. Miller Theory of scheduling 1967 Addison-Wesley Reading, MA
2. M. Garey, R. Tarjan, and G. Wilfong One-processor scheduling with symmetric earliness and tardiness penalties Mathematics of Operations Research 13 1988 330 348
3. Yano C, Kim Y. Algorithms for single machine scheduling problems minimizing tardiness and earliness. Technical report #86-40, Department of Industrial Engineering, University of Michigan, Ann Arbor, USA, 1986.
4. T. Abdul-Razaq, and C. Potts Dynamic programming state-space relaxation for single-machine scheduling Journal of the Operational Research Society 39 1988 141 152
5. Szwarc W. Minimizing absolute lateness in single machine scheduling with different due dates. Working Paper, University of Wisconsin, Milwaukee, USA, 1988.
6. P. Ow, and T. Morton Filtered beam search in scheduling International Journal of Production Research 26 1988 35 62
7. P. Ow, and T. Morton The single machine early-tardy problem Management Science 35 1989 177 191
8. Fry T, Darby-Dowman K, Armstrong R. Single machine scheduling to minimize mean absolute lateness. Working Paper, College of Business Administration, University of South Carolina, Columbia, USA, 1988.
9. K. Baker, and G. Scudder Sequencing with earliness and tardiness penalties: a review Operations Research 38 1990 22 36
10. P. Chrétienne, and F. Sourd PERT scheduling with convex cost functions Theoretical Computer Science 292 2003 145 164