A recovering beam search algorithm for the single machine Just-in-Time scheduling problem

European Journal of Operational Research

Volumn 172, Issue 3, 2006, Pages 798-813

  Esteve, B ^a   Aubijoux, C ^a   Chartier, A ^a   T'kindt, V ^a  

^a UNIVERSITÉ DE TOURS   (France)

Author keywords

Just in Time scheduling; Multicriteria optimisation; Recovering beam search

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; CONSTRAINT THEORY; HEURISTIC PROGRAMMING; PROBLEM SOLVING; SCHEDULING; STATISTICAL METHODS;

BEAM SEARCH ALGORITHM; JUST-IN-TIME SCHEDULING; MEAN WEIGHTED DEVIATION; MULTICRITERIA OPTIMIZATION;

JUST IN TIME PRODUCTION;

EID: 33645859030     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.11.014     Document Type: Article

References (30)

1. Baker K.R., and Scudder G.D. Sequencing with earliness and tardiness penalties: a review. Operations Research 38 1 (1990) 22-36
2. Chrétienne P., and Sourd F. Pert scheduling with convex cost functions. Theoretical Computer Science 292 1 (2003) 145-164
3. Davis J.S., and Kanet J.J. Single machine scheduling with early and tardy completion costs. Naval Research Logistics 40 (1993) 85-101
4. F. Della Croce, M. Ghirardi, R. Tadei, Recovering beam search: Enhancing the beam search approach for combinatorial problems, PlanSIG2002 Conference Proceedings, Delft (The Netherlands), 2002, pp. 149-169.
5. B. Esteve, C. Aubijoux, A. Chartier, V. T'kindt, Résolution heuristique d'un problème d'ordonnancement multicritère à une machine de type juste-à-temps. 4ème Conférence de la Société Francaise de Recherche Opérationnelle et d'Aide à la Décision (ROADEF'02), Paris (France), in French, 2002.
6. Fry T.D., Armstrong R.D., and Blackstone R.H. Minimizing weighted absolute deviation in single machine scheduling. IIE Transactions 19 4 (1987) 445-450
7. Fry T.D., and Blackstone R.H. Planning for idle time: A rationale for underutilization of capacity. International Journal of Production Research 26 12 (1988) 1853-1859
8. Garey M.R., Tarjan R.E., and Wilfong G.T. One-processor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Research 13 2 (1988) 330-348
9. Gordon V., Proth J.-M., and Chu C. Due date assignment and scheduling: SLK, TWK and other due date assignment models. Production, Planning and Control 13 2 (2002) 117-132
10. Gordon V., Proth J.-M., and Chu C. A survey of the state-of-the-art of common due date assignment and scheduling research. European Journal of Operational Research 139 1 (2002) 1-25
11. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5 (1979) 287-326
12. Hall N.G., Kubiak W., and Sethi S. Earliness-tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date. Operations Research 39 (1991) 847-856
13. Hall N.G., and Posner M.E. Earliness-tardiness scheduling problems, I: Weighted deviation of completion times about a common due date. Operations Research 39 (1991) 836-846
14. Hoogeveen H., and van de Velde S.M. Earliness-tardiness scheduling around almost equal due dates. INFORMS Journal on Computing 9 1 (1997) 92-99
15. James R.J.W., and Buchanan J.T. A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem. European Journal of Operational Research 102 (1997) 513-527
16. James R.J.W., and Buchanan J.T. Performance enhancements to tabu search for the early/tardy scheduling problem. European Journal of Operational Research 106 (1998) 254-265
17. Kovalyov M.Y., and Kubiak W. A fully polynomial approximation scheme for the weighted earliness-tardiness problem. Operations Research 47 5 (1999) 757-761
18. Kubiak W., and Sethi S.P. A note on 'level schedules for mixed-model assembly lines in Just-in-Time productions systems'. Management Science 37 1 (1991) 121-122
19. Kubiak W., and Sethi S.P. Optimal Just-in-Time schedules for flexible transfer lines. The International Journal of Flexible Manufacturing Systems 6 (1994) 137-154
20. Lee C.Y., and Choi J.Y. A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights. Computers and Operations Research 22 8 (1995) 857-869
21. Mazzini R., and Armentano A. A heuristic for single machine scheduling with early and tardy costs. European Journal of Operational Research 128 (2001) 129-146
22. Ow P.S., and Morton T.E. Filtered beam search in scheduling. International Journal of Production Research 26 1 (1988) 35-62
23. Ow P.S., and Morton T.E. The single machine early/tardy problem. Management Science 35 2 (1989) 177-190
24. Soland R.M. Multicriteria optimization: A general characterization of efficient solutions. Decision Sciences 10 (1979) 27-38
25. Sourd F. The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions. INFORMS Journal on Computing 16 (2004) 198-208
26. Sridharan V., and Zhou Z. A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems. European Journal of Operational Research 94 (1996) 292-301
27. Steiner G., and Yeomans S. Level schedules for mixed-model, Just-in-Time processes. Management Science 39 6 (1993) 728-734
28. Szwarc W., and Mukhopadhyay S.K. Optimal timing schedules in earliness-tardiness single machine sequencing. Naval Research Logistics 42 (1995) 1109-1114
29. T'kindt V., and Billaut J.-C. Multicriteria Scheduling: Theory, Models and Algorithms (2002), Springer
30. 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) 167-178