Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time

Computers and Industrial Engineering

Volumn 48, Issue 2, 2005, Pages 363-375

  Valente, Jorge M S ^a   Alves, Rui A F S ^a  

^a UNIVERSITY OF PORTO   (Portugal)

Author keywords

Beam search; Early tardy; Heuristics; Scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; FUNCTIONS; HEURISTIC METHODS; ONLINE SEARCHING; SCHEDULING;

BEAM SEARCH ALGORITHMS; EARLY/TARDY SCHEDULING PROBLEM; FILTERING PROCEDURES; SEARCH ALGORITHMS;

PROBLEM SOLVING;

EID: 14044249418     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2005.01.020     Document Type: Article

References (16)

1. T. Abdul-Razaq, and C.N. Potts Dynamic programming state-space relaxation for single machine scheduling Journal of the Operational Research Society 39 1988 141 152
2. F. Della Croce, and V. T'kindt A recovering beam search algorithm for the one-machine dynamic total completion time scheduling problem Journal of the Operational Research Society 53 2002 1275 1280
3. Fox, M. S. (1983). Constraint-directed search: a case study of job-shop scheduling. Ph.D. Thesis, Carnegie-Mellon University, USA.
4. Korman, K. (1994). A pressing matter. Video, (pp. 46-50).
5. 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.
6. J.K. Lenstra, A.H.G. Rinnooy Kan, and P. Brucker Complexity of machine scheduling problems Annals of Discrete Mathematics 1 1977 343 362
7. G. Li Single machine earliness and tardiness scheduling European Journal of Operational Research 96 1997 546 558
8. C.-F. Liaw A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem Computers and Operations Research 26 1999 679 693
9. Lowerre, B. T. (1976). The HARPY Speech Recognition System. Ph.D. Thesis, Carnegie-Mellon University, USA.
10. P.S. Ow, and E.T. Morton The single machine early/tardy problem Management Science 35 1989 177 191
11. P.S. Ow, and T.E. Morton Filtered beam search in scheduling International Journal of Production Research 26 1988 35 62
12. P.S. Ow, and S.F. Smith Viewing scheduling as an opportunistic problem-solving process Annals of Operations Research 12 1988 85 108
13. Rubin, S. (1978). The ARGOS image understanding system. Ph.D. Thesis, Carnegie-Mellon University, USA.
14. I. Sabuncuoglu, and M. Bayiz Job shop scheduling with beam search European Journal of Operational Research 118 1999 390 412
15. Valente, J. M. S., Alves, R. A. F. S. (in press). Improved lower bounds for the early/tardy scheduling problem with no idle time. Working Paper 125, Faculdade de Economia do Porto, Portugal. Journal of the Operational Research Society.
16. J.M.S. Valente, and R.A.F.S. Alves Improved heuristics for the early/tardy scheduling problem with no idle time Computers and Operations Research 32 2005 557 569