Flow-Shop Scheduling: Effect of Various Priority Rules on Minimizing Multiple Criteria
Summary
The flow-shop scheduling problem is one of the most important industrial activity, especially in the flexible flow lines where assembly lines are the main goal. The study described in this paper is mainly concerned with evaluating the effectiveness of various priority rules on multiple criteria for the pure flow-shop scheduling problem. The objective is to determine an order in which to process n jobs on m machines in the same order and skipping is not allowed in order to obtain near-optimal value for make-span, mean completion times, total waiting times and total idle times. The simulation approach for deterministic and stochastic pure flowshop scheduling has been developed. It reads data for (90 × 90) processing times matrix. Different factorial experiments for comparison between selected six rules, such as 4-machines shop (5, 15, 20 and 30) and 13 levels of WIP were executed under 500 runs.
Preview
Unable to display preview. Download preview PDF.
References
- 1.S.M. Johnson(1954), “Optimal Two and Three Stage Production Schedules with Set-up time Included,” Nav. Res. Log. Quart. 1, 61–68.Google Scholar
- 2.J.N.D. Gupta(1971), “A functional heuristics algorithm for the flow-shop scheduling problem”, Operations Research, 22, 1, pp 39–48.CrossRefMATHGoogle Scholar
- 3.E. Ignall. et al(1965), “An application of the branch and bound technique to some flow-shop scheduling problems.”, Operation Research, 13, 3, pp 400–412.MathSciNetCrossRefGoogle Scholar
- 4.H.G. Campbell. et al (1970), “A heuristic algorithm for N-job and M-machines sequencing problem”, Management Science, 16, pp 630–673.CrossRefGoogle Scholar
- 5.H. Bera(1983). “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 Polytechnic, pp 290–299.Google Scholar
- 6.D.G. Dannenbring(1977) “An evaluation of flowshop sequencing heuristics”, Management Science, 23, 11, pp 1174–1182.CrossRefMATHGoogle Scholar
- 7.A.J. Rowe(Mar.–Apr. 1960) “Toward a theory of scheduling”, Journal of Industrial Engg., 11:2, pp 125–136.Google Scholar
- 8.S.S. Panwaler and W. Iskander(1977) “A survey of scheduling rules” Operation research, 25, pp 45–61.CrossRefGoogle Scholar
- 9.C.T. Baker et al(Apr. 1960) “Simulation of a simplified job shop”, Management science, V. 6 pp 311–323.CrossRefGoogle Scholar
- 10.L. Villeneuve (Ecole Polytechnic of Montreal)and A. Tison(1988) “Simulation For Manufacturing Management Decisions”, Arab school of science & Technology, Product Development & Production Engineering, 12th summer session 1988, sponsored by Scientific Studies & Research Centre, Damascus (Syria), pp. 16–29.Google Scholar
- 11.G.L. Thompson(1960) “Recent development in the job-shop scheduling problem” Nay. Res. Logist. Q. 7, 585.Google Scholar
- 12.Jr. William. S. Gere(1966) “Heuristics in job shop scheduling”, Management Science, V. 13, No. 3, pp 167–190.CrossRefGoogle Scholar
- 13.D.S. Palmer(1965) “Sequencing jobs through a multi-stage process in the minimum total time — a quick method of obtaining a near optimum-” Opl. Res. Q., 16, pp 101–107.CrossRefGoogle Scholar
- 14.G.H. Brooks and C.R. White(1965) “The algorithm for finding optimal or near optimal solution to the production scheduling problem”, Journal of industrial engg., V. 16, pp 34–40.Google Scholar