A comparison of lower bounds for the single-machine early/tardy problem

Computers and Operations Research

Volumn 34, Issue 8, 2007, Pages 2279-2292

  Schaller, Jeffrey ^a  

^a EASTERN CONNECTICUT STATE UNIVERSITY   (United States)

Author keywords

Branch and bound; Heuristics; Scheduling; Sequencing

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; PARAMETER ESTIMATION; SCHEDULING;

BRANCH-AND-BOUND ALGORITHM; SEQUENCING; SINGLE MACHINE EARLY/TARDY PROBLEM; TIMETABLING ALGORITHM;

PROBLEM SOLVING;

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

References (15)

1. 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
2. Baker K.R., and Scudder G.D. Sequencing with earliness and tardiness penalties: a review. Operations Research 38 (1990) 22-36
3. Kanet J.J. Minimizing the average deviation of job completion times about a common due date. Naval Research Logistics Quarterly 28 (1981) 643-651
4. Sundararaghavan P.S., and Ahmed M.U. Minimizing the sum of absolute lateness in single-machine scheduling. Naval Research Logistics Quarterly 31 (1984) 325-333
5. Bagchi U., Sullivan R.S., and Chang Y.L. Minimising mean absolute deviation of completion times about a common due date. Naval Research Logistics Quarterly 33 (1986) 227-240
6. Abdul-Razaq T., and Potts C. Dynamic programming state-space relaxation for single-machine scheduling. Journal of the Operational Research Society 39 (1988) 141-152
7. Ow P.S., and Morton T.E. The single machine early/tardy problem. Management Science 35 (1989) 177-191
8. Kanet J.J., and Sridharan V. Scheduling with inserted idle time: problem taxonomy and literature review. Operations Research 48 (2000) 99-110
9. Fry T.D., Armstrong R.D., and Blackstone J.H. Minimizing weighted absolute deviation in single machine scheduling. IIE Transactions 9 (1987) 445-450
10. Davis J.S., and Kanet J.J. Single-machine scheduling with early and tardy completion costs. Naval Research Logistics 40 (1993) 85-101
11. Yano C.A., and Kim Y.-D. Algorithms for a class of single machine weighted tardiness and earliness problems. European Journal of Operational Research 52 (1991) 161-178
12. Kim Y.D., and Yano C.A. Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates. Naval Research Logistics 41 (1994) 913-933
13. Szwarc W. Adjacent ordering in single-machine scheduling with earliness and tardiness penalties. Naval Research Logistics 40 2 (1993) 229-244
14. Coleman B.J. A simple model for optimizing the single machine early/tardy problem with sequence dependent setups. Production and Operations Management 1 (1992) 225-228
15. Balakrishnan N., Kanet J.J., and Sridharan V. Early/Tardy scheduling with sequence dependent setups on uniform parallel machines. Computers and Operations Research 26 (1999) 127-141