Flow Shop Scheduling Problem
Dublin Institute of Technology
ARROW@DIT
Conference papers School of Marketing
2002-01-01
Flow Shop Scheduling Problem: a Computational Study
Amr Arisha
Dublin Institute of Technology,, amr.arisha@dit.ie
Paul Young
Dublin City University
Mohie El Baradie
Dublin City University
Follow this and additional works at: http://arrow.dit.ie/buschmarcon Part of the Other Operations Research, Systems Engineering and Industrial Engineering Commons Recommended Citation
Arish, A., Young, P., El Baradie, M.:Flow Shop Scheduling Problem: a Computational Study.Sixth International Conference on Production Engineering and Design for Development (PEDD6),Cairo, Egypt, pp 543 – 557.
This Conference Paper is brought to you for free and open access by the School of Marketing at ARROW@DIT. It has been accepted for inclusion in Conference papers by an authorized administrator of ARROW@DIT. For more information, please contact yvonne.desmond@dit.ie, arrow.admin@dit.ie.
This work is licensed under a Creative Commons AttributionNoncommercial-Share Alike 3.0 License
FLOW SHOP SCHEDULING PROBLEM: A COMPUTATIONAL STUDY
A. Arisha, P. Young, and M. EL Baradie
School of Mechanical & Manufacturing Engineering, Dublin City University Dublin 9, Ireland Email: amr.arisha@gmail.com
ABSTRACT: A computational study has been developed to obtain optimal / near optimal solution for the flow shop scheduling problem with make-span minimization as the primary criterion and the minimization of either the mean completion time, total waiting time or total idle time as the secondary criterion. The objective is to determine a sequence of operations in which to process ‘n’ jobs on ‘m’ machines in same order (flow shop environment) where skipping is allowed. The Simulation approach for deterministic and stochastic flow shop scheduling has been developed. It reads and manipulates data for 500 jobs on 500 machines. Different factorial experiments present a comparative study on the
ARROW@DIT
Conference papers School of Marketing
2002-01-01
Flow Shop Scheduling Problem: a Computational Study
Amr Arisha
Dublin Institute of Technology,, amr.arisha@dit.ie
Paul Young
Dublin City University
Mohie El Baradie
Dublin City University
Follow this and additional works at: http://arrow.dit.ie/buschmarcon Part of the Other Operations Research, Systems Engineering and Industrial Engineering Commons Recommended Citation
Arish, A., Young, P., El Baradie, M.:Flow Shop Scheduling Problem: a Computational Study.Sixth International Conference on Production Engineering and Design for Development (PEDD6),Cairo, Egypt, pp 543 – 557.
This Conference Paper is brought to you for free and open access by the School of Marketing at ARROW@DIT. It has been accepted for inclusion in Conference papers by an authorized administrator of ARROW@DIT. For more information, please contact yvonne.desmond@dit.ie, arrow.admin@dit.ie.
This work is licensed under a Creative Commons AttributionNoncommercial-Share Alike 3.0 License
FLOW SHOP SCHEDULING PROBLEM: A COMPUTATIONAL STUDY
A. Arisha, P. Young, and M. EL Baradie
School of Mechanical & Manufacturing Engineering, Dublin City University Dublin 9, Ireland Email: amr.arisha@gmail.com
ABSTRACT: A computational study has been developed to obtain optimal / near optimal solution for the flow shop scheduling problem with make-span minimization as the primary criterion and the minimization of either the mean completion time, total waiting time or total idle time as the secondary criterion. The objective is to determine a sequence of operations in which to process ‘n’ jobs on ‘m’ machines in same order (flow shop environment) where skipping is allowed. The Simulation approach for deterministic and stochastic flow shop scheduling has been developed. It reads and manipulates data for 500 jobs on 500 machines. Different factorial experiments present a comparative study on the
References: 1. 2. 3. 4. 5. 6. 7. 8. JOHNSON, S. M., “Optimal Two and Three Stage Production Schedules with Set-up time Included”. Nav. Res. Log. Quart. , Vol. 1, pp. 61-68, (1954). CAMPBELL, H. G. “ A heuristic algorithm for n-job and m-machines sequencing problem”. Management Science, Vol. 16, pp. 630-673, (1970). BAKER, KENNETH R., “ Sequencing and Scheduling”. John Wiley & Sons Inc.(1998), ISBN: 0-9639746-1-0. GUPTA, J.N.D. , “A functional heuristics algorithm for the flow-shop scheduling problem”. Operation Research, Vol. 22, No. 1, pp.39- 48, (1971). FRENCH, S. “Sequencing and Scheduling”. An introduction to the mathematics of the job shop, Ellis Horwood series, (1982). DANNENBRING, D. G. , “ An evaluation of flowshop sequencing heuristics”. Management Science, Vol. 23, No. 11, pp. 1174-1182, (1977). PINEDO, MICHEAL and BHASKARAN, K. “ Dispatching”. Handbook of Industrial Engineering, pp. 2182-2198, (1992). BERA, H., “To minimize waiting time of jobs, idle time of machines and total elapsed time for N jobs on M machines”. 2nd Joint international conference on Production Engineering, Leicester Polytechnis, pp. 290-299, (1983). EZAT, A. M. and EL BARADIE, M. “ Flow-Shop Scheduling: Effect of Various Priority Rules on Minimizing Multiple Criteria”. 30th International MATADOR Conference (UMIST), (1993). TSENG, FAN and STAFFORD, E. ,“Two MILP models for N x M SDST flowshop sequencing problem ”. Int. J. Prod. Res., Vol. 39, No. 8, 1777 – 1809, (2001). GRAVES, STEPHEN ,“ A Review of Production Scheduling”. Operations Research, Vol. 29, pp. 646-675, (1981). RAJENDRAN, C. and HOLTHAUS, OLIVER, “ A Comparative study of dispatching rules in dynamic flowshops and jobshops”. European Journal of Operational Research, Vol. 116, pp.156-170, (1999). TAILLARD, ERIC D., “ Some efficient heuristic methods for the flowshop sequencing problem”. European Journal of Operational Research, Vol.47, pp. 65-74, (1990). PINEDO, MICHEAL, “ Operations scheduling with applications in manufacturing and services”. Irwin/McGraw-Hill, (1998). ISBN: 0072897791. STAFFORD, E. F., “On the development of a mixed-integer linear programming model for the standard flowshop”. Journal of the Operational Research Society, Vol. 39, pp. 11631174, (1988). BLAZEWICZ, J., ECKER, KLAUS H., SCHMIDT, GUENTER and WEGLARZ, J., “Scheduling in Computer and Manufacturing Systems”. Springer Verlag, Berlin (1994). ISBN: 3540580492. MEZIANE, VADERA, KOBBACY and PROUDLOVE, “Intelligent Systems in Manufacturing: Current Developments and Future Prospects”. Integrated Manufacturing System, Vol. 11, No. 4, pp. 218-238, (2000). CONWAY, R. W., MAXWELL, W.L. and MILLER, I. W. ,“ Theory of Scheduling ”. Addison Wesley, Reading, Massachusetts, (1967). 9. 10. 11. 12. 13. 14. 15. 16. 17. 18.