Optimal scheduling for flexible job shop operation

International Journal of Production Research

Volumn 43, Issue 11, 2005, Pages 2323-2353

  Gomes, M C ^a   Barbosa Povoa A P ^a   Novais, A Q ^b  

^a INSTITUTO SUPERIOR TÉCNICO   (Portugal)

^b INETI   (Portugal)

Author keywords

Flexible job shop; Integer linear programming model; Make to order industries; Re circulation; Scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FLEXIBLE MANUFACTURING SYSTEMS; LINEAR PROGRAMMING;

FLEXIBLE JOB SHOP; JOB SHOP OPERATION; OPTIMAL SCHEDULING;

PRODUCTION ENGINEERING;

EID: 27944444515     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540412331330101     Document Type: Article

References (32)

1. Brown, D.E., Marin, J.A. and Scherer, W.T., A survey of intelligent scheduling systems. In Intelligent Scheduling Systems, edited by D.E. Brown and W.T. Scherer, pp. 1-40, 1995 (Kluwer Academic Publishers: Boston, US).
2. Castro, P., Barbosa-Póvoa, A.P.F.D. and Matos, H., An improved RTN continuous-time formulation for the short-term scheduling of multi-purpose batch plants. Indust. Eng. Chem. Res., 2001, 40, 2059-2068.
3. Chang, S.-C. and Liao, D.-Y., Scheduling flexible flow shops with no set-up effects. IEEE Trans. Robot. Autom., 1994, 10, 112-122.
4. Demirkol, E., Mehta, S. and Uzsoy, R., Benchmarks for shop scheduling problems. Euro. J. Oper. Res., 1998, 109, 137-141.
5. Dorn, J., Girsch, M., David, T. and Prianichnikova, A., Project REFRESH - A Reusable and Extendable Framework for Reactive Scheduling, 1998, Computer Science Department, Vienna University of Technology (http://www.dbai.tuwien.ac. at/proj/Refresh).
6. French, S., Sequencing and Scheduling: An Introduction to the Mathematics of the Job-shop, 1982 (Ellis Horwood: Chichester, UK).
7. GAMS - A User's Guide, 1998 (GAMS Development Corporation, US).
8. Harjunkoski, I. and Grossman, I.E., Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming approaches. Comput. Chem. Eng., 2002, 26, 1533-1552.
9. Jain, A.S. and Meeran, S., Deterministic job shop scheduling: Past, present, future. Euro. J. Oper. Res., 1999, 113, 390-434.
10. Jain, A.S. and Meeran, S., A state-of-the-art review of job-shop scheduling techniques, 1998, Technical report, University of Dundee, Scotland, UK.
11. Kim, K.-H. and Egbelu, P.J., Scheduling in a production environment with multiple process plans per job. Int. J. Prod. Res., 1999, 37, 2725-2753.
12. Lageweg, B.J., Lenstra, J.K. and Rinnooy Kan, A.H.G., Job shop scheduling by implicit enumeration. Manage. Sci., 1977, 24, 441-450.
13. Liao, C.-J. and You, C.-T., An improved formulation for the job-shop scheduling problem. J. Oper. Res. Soc., 1992, 43, 1047-1054.
14. Liao, D.-Y., Chang, S.-C., Pei, K.-W. and Chang, C.-M., Daily scheduling for R&D semiconductor fabrication. IEEE Trans. Semicon. Manuf., 1996, 9, 550-560.
15. Low, C. and Wu, T.-H., Mathematical modelling and heuristic approaches to operation scheduling problems in an FMS environment. Int. J. Prod. Res., 2001, 39, 689-708.
16. Luh, P.B. and Hoitomt, D.J., Scheduling of manufacturing systems using the lagrangian relaxation technique. IEEE Trans. Auto. Cont., 1993, 38, 1066-1079.
17. Manne, A.S., On the job-shop scheduling problem. Oper. Res., 1960, 8, 219-223.
18. McKoy, D.H.C. and Egbelu, P.J., Production scheduling in a process and assembly job shop. Prod. Plan. Cont., 1999, 10, 76-86.
19. Pan, C.H., A study of integer programming formulations for scheduling problems. Int. J. Syst. Sci., 1997, 28, 33-41.
20. Papageorgiou, L.G. and Pantelides, C.C., Optimal campaign planning/scheduling of multipurpose batch/semi-continuous plants. 2. A mathematical decomposition approach. Indust. Eng. Chem. Res., 1996, 35, 510-529.
21. Pinedo, M., Scheduling: Theory, Algorithms and Systems, 1995 (Prentice-Hall: New Jersey, US).
22. Reklaitis, S., Overview of Scheduling and Planning of Batch Process Operations, 1992 (NATO Advanced Study Institute, Batch Processing Systems Engineering, Antalya, Turkey).
23. Roslöf, J., Harjunkoski, I., Westerlund, T. and Isaksson, J., Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure. Euro. J. Oper. Res., 2002, 138, 29-42.
24. Sawik, T., Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers. Math. Comput. Model., 2000, 31, 39-52.
25. Shah, N., Pantelides, C.C. and Sargent, R.W.H., A general algorithm for short-term scheduling of batch operations. II. Computational issues. Comput. Chem. Eng., 1993, 17, 229-244.
26. Shapiro, J.F., Mathematical programming models and methods for production planning and scheduling. In Handbooks in Operations Research and Management Science, Volume 4: Logistics of Production and Inventory, edited by S.C. Graves, A.H.G. Rinnooy Kan and P.H. Zipkin, pp. 371-443, 1993 (North Holland: Amsterdam).
27. Schilling, G. and Pantelides, C.C., A simple continuous-time process scheduling formulation and a novel solution algorithm. Comput. Chem. Eng., 1996, 20, S1221-S1226.
28. Sule, D.R., Industrial Scheduling, 1997 (PWS Publishing Company: Boston, US).
29. Wilkinson, S.J., Aggregate Formulations for Large-scale Process Scheduling Problems, PhD thesis, 1996 (Imperial College, London, UK).
30. Yaghubian, A.R., Hodgson, T.J. and Joines, J.A., Dry-or-buy decision support for dry kiln scheduling in furniture production. IIE Trans., 2001, 33, 131-136.
31. Zhang, X. and Sargent, R., The optimal operation of mixed production facilities - general formulation and some solution approaches to the solution. Comput. Chem. Eng., 1996, 20, 897-904.
32. Zhu, Z. and Heady, R.B., Minimizing the sum of earliness/tardiness in multi-machine scheduling - a mixed integer programming approach. Comput. Indust. Eng., 2000, 38, 297-305.