Improved lower bounds for the early/tardy scheduling problem with no idle time

Journal of the Operational Research Society

Volumn 56, Issue 5, 2005, Pages 604-612

  Valente, J M S ^a   Alves, R A F S ^a  

^a UNIVERSITY OF PORTO   (Portugal)

Author keywords

Early tardy; Lower bound; Sequencing

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE; COSTS; DYNAMIC PROGRAMMING; LAGRANGE MULTIPLIERS; LOGISTICS; MATHEMATICAL MODELS;

EARLY/TARDY; LOWER BOUND; SEQUENCING; WEIGHTED LONGEST PROCESS TIME (WLPT);

PROBLEM SOLVING;

EID: 17644417123     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601865     Document Type: Article

References (14)

1. Korman K (1994). A pressing matter. Video February: 46-50.
2. Landis K. (1993). Group technology and cellular manufacturing in the Westvaco Los Angeles VH Department. Project report in IOM 581, School of Business, University of Southern California, USA.
3. Baker KR and Scudder GD (1990). Sequencing with earliness and tardiness penalties: a review. Opns Res 38: 22-57.
4. Lenstra JK, Rinnooy Kan AHG and Brucker P (1977). Complexity of machine scheduling problems. Ann Disc Math 1: 343-362.
5. Abdul-Razaq T and Potts CN (1988). Dynamic programming state-space relaxation for single machine scheduling. J Opl Res Soc 39: 141-152.
6. Li G (1997). Single machine earliness and tardiness scheduling. Eur J Opl Res 96: 546-558.
7. Liaw CF (1999). A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem. Comput Opns Res 26: 679-693.
8. Ow PS and Morton ET (1988). The single machine early/tardy problem. Mngt Sci 35: 177-191.
9. Valente JMS and Alves RAFS (2003). Improved heuristics for the early/tardy scheduling problem with no idle time. Working Paper 126, Faculdade de Economia do Porto, Portugal.
10. Potts CN and van Wassenhove LN (1985). A branch-and-bound algorithm for the total weighted tardiness problem. Opns Res 33: 363-377.
11. Smith WE (1956). Various optimizers for single-stage production. Nav Res Log Q 3: 59-66.
12. Jackson JR (1955). Scheduling a production line to minimize maximum tardiness. Management Science Research Project, Research Report 43, University of California, Los Angeles, USA.
13. Rachamadugu RV and Morton TE (1981). Myopic heuristics for the single machine weighted tardiness problem. Working Paper 28-81-82, Graduate School of Industrial Administration, Carnegie-Mellon University, USA.
14. Rachamadugu RMV (1987). A note on the weighted tardiness problem. Opns Res 35: 450-452.