Two-machine shop scheduling: Compromise between flexibility and makespan value

European Journal of Operational Research

Volumn 167, Issue 3, 2005, Pages 796-809

  Esswein, Carl ^a   Billaut, Jean Charles ^a   Strusevich, Vitaly A ^b  

^a UNIVERSITÉ DE TOURS   (France)

^b UNIVERSITY OF GREENWICH   (United Kingdom)

Author keywords

Flexibility; Flow shop; Job shop; Open shop; Robustness; Scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DECISION MAKING; HEURISTIC METHODS; JOB ANALYSIS; OPERATIONS RESEARCH;

FLEXIBILITY; FLOW SHOP; JOB SHOP; OPEN SHOP; ROBUSTNESS;

SCHEDULING;

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

References (26)

1. M.A. Aloulou, M.-C. Portmann, Incorporating flexibility in job sequencing for the single machine total weighted tardiness problem with release dates, in: 10th Annual Industrial Engineering Research Conference, IIE, May 2001
2. M.A. Aloulou, M.-C. Portmann, A. Vignier. Predictive-reactive scheduling for the single machine problem, in: Eighth International Workshop on Project Management and Scheduling (PMS 2002), Valencia (Spain), April 2002, pp. 39-42
3. Artigues C., Roubellat F., Billaut J.-C. Characterization of a set of schedules in a resource constrained multi-project scheduling problem with multiple modes. International Journal of Industrial Engineering. 6(2):1999;112-122
4. J.-C. Billaut, F. Roubellat, A decision support system for real time scheduling, in: International Conference on Industrial Engineering and Production Management. Proceedings (IEPM 1993), Mons (Belgium), 1993
5. Billaut J.-C., Roubellat F. A new method for workshop real time scheduling. International Journal of Production Research. 34(6):1996;1555-1579
6. Branke J., Mattfeld D.C. Anticipation in dynamic optimization: The scheduling case. Schoenauer M., Deb K., Rudolph G., Yao X., Lutton E., Merelo J.J., Schwefel H. Parallel Problem Solving from Nature - PPSN VI proceedings. LNCS. vol. 1917:2000;253-262 Springer
7. A.J. Davenport, J.C. Beck, A survey of techniques for scheduling with uncertainty. Unpublished, available from , 2000
8. de Werra D. Graph-theoretical models for preemptive scheduling. Slowinski R., Weglarz J. Advances in Project Scheduling. 1989;171-185 Elsevier, Amsterdam
9. Erschler J., Roubellat F., Vernhes J.-P. Finding some essential characteristics of the feasible solutions for a scheduling problem. Operations Research. 24(4):1976;772-782
10. C. Esswein, J.-C. Billaut, Trade-off between flexibility and maximum completion time in the two-machine flowshop scheduling problem, in: International Symposium on Combinatorial Optimisation (CO2002), Paris (France), April 2002, p. 50
11. Garey M.R., Johnson D.S. Computers and Intractability. A Guide to the Theory of NP-Completeness. 1979;W.H. Freeman and Company, New York
12. Glass C.A., Potts C.N., Strusevich V.A. Scheduling batches with sequential job processing for two-machine flow and open shops. INFORMS Journal on Computing. 13(2):2001;120-137
13. Gonzalez T., Sahni S. Open shop scheduling to minimize finish time. Journal of the Association for Computing Machinery. 23:1976;665-679
14. Graham R.L., Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics. 5:1979;287-326
15. W. Herroelen, R. Leus, Project scheduling under uncertainty. Survey and research potentials, European Journal of Operational Research, in press
16. Jackson J.R. An extension of Johnson's results on job lot scheduling. Naval Research Logistics Quarterly. 3:1956;201-203
17. Johnson S.M. Optimal two and three stage production schedules with set-up time included. Naval Research Logistics Quarterly. 1:1954;61-68
18. Kellerer H., Pfershy U. A new fully polynomial time approximation scheme for the knapsack problem. Journal of Combinatorial Optimization. 3:1999;59-71
19. Kouvelis P., Daniels R.L., Vairaktarakis G. Robust scheduling of a two-machine flow shop with uncertain processing times. IIE Transactions. 32:2000;421-432
20. Leon V.J., Wu S.D., Storer R.H. Robustness measures and robust scheduling for job shops. IEEE Transactions. 26(5):1994;32-43
21. Martello S., Pisinger D., Toth P. Dynamic programming and strong bounds for the 0-1 knapsack problem. Management Science. 45:1999;414-424
22. P. Mauguière, J.-C. Billaut, C. Artigues, Grouping on a single machine with heads and tails to represent a family of dominant schedules, in: Eighth International Workshop on Project Management and Scheduling (PMS 2002), Valencia (Spain), April 2002, pp. 265-269
23. Mehta S.V., Uzsoy R.M. Predictive scheduling of a single machine subject to breakdowns. International Journal of Computer Integrated Manufacturing. 12(1):1999;15-38
24. Pinedo M., Schrage L. Stochastic shop scheduling: A survey. Dempster M.A.H., et al. Deterministic and Stochastic Scheduling. 1982;181-196 Reidel, Dordrecht
25. Potts C.N., Kovalyov M.Y. Scheduling with batching: A review. European Journal of Operational Research. 120:2000;228-249
26. Vieira G.E., Herrmann J.W., Lin E. Rescheduling manufacturing systems: A framework of strategies, policies, and methods. Journal of Scheduling. 6:2003;39-62