Scheduling a flow shop with combined buffer conditions

International Journal of Production Economics

Volumn 117, Issue 2, 2009, Pages 371-380

  Liu, Shi Qiang ^a   Kozan, Erhan ^a  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

Blocking; Combined buffer; Flow shop; Limited buffer; No wait; Scheduling

Indexed keywords

ALGORITHMS; HEURISTIC ALGORITHMS; MACHINE SHOP PRACTICE; SCHEDULING;

BLOCKING; COMBINED-BUFFER; FLOW SHOP; LIMITED-BUFFER; NO-WAIT;

SCHEDULING ALGORITHMS;

EID: 58949084435     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2008.11.007     Document Type: Article

References (27)

1. Abadi I.N.K., Hall N.G., and Sriskandarajah C. Minimizing cycle time in a blocking flowshop. Operations Research 48 1 (2000) 177-180
2. Campbell H.G., Dudek R.A., and Smith M.L. A heuristic algorithm for the n job m machine sequencing problem. Management Science 16 10 (1970) 630-637
3. Caraffa V., Ianes S., Bagci T.P., and Sriskandarajah C. Minimizing makespan in a blocking flowshop using genetic algorithms. International Journal of Production Economics 70 (2001) 101-115
4. Chen C.L., Neppalli R.V., and Aljaber N. Genetic algorithms applied to the continuous flow shop problem. Computers & Industrial Engineering 1996 (1996) 919-929
5. Fink A., and Voß S. Solving the continuous flow-shop scheduling problem by metaheuristics. European Journal of Operational Research 151 (2003) 400-414
6. Grabowski J., and Pempera J. The permutation flow shop problem with blocking. A tabu search approach. Omega 35 3 (2007) 302-311
7. Grabowski J., and Wodecki M. A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Computers & Operations Research 31 (2004) 1891-1909
8. Gupta J.N.D. A functional heuristic algorithm for the flow shop scheduling problem. Operational Research Quarterly 22 1 (1971) 61-68
9. Hall N.G., and Sriskandarajah C. A survey of machine scheduling problems with blocking and no-wait in process. Operations Research 44 3 (1996) 510-525
10. Johnson S.M. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1 1 (1954)
11. Leisten R. Flowshop sequencing with limited buffer storage. International Journal of Production Research 28 (1990) 2085-2100
12. Liu, S.Q., Kozan, E., 2007. A blocking parallel-machine job-shop-scheduling model for the train scheduling problem. In: Proceedings of the Eighth Asia-Pacific Industrial Engineering and Management Systems Conference, Kaohsiung, Taiwan, pp. 10.1-10.10.
13. Liu S.Q., and Ong H.L. A comparative study of algorithms for the flowshop scheduling problem. Asia-Pacific Journal of Operational Research 19 (2002) 205-222
14. McCormick S.T., Pinedo M.L., Shenker S., and Wolf B. Sequencing in an assembly line with blocking to minimize cycle time. Operations Research 37 6 (1989) 925-935
15. Nawaz M., Enscore E.E., and Ham I. A heuristic algorithm for the m-machine, n-job flow sequencing problem. Omega 11 1 (1983) 91-95
16. Nowicki E., and Smutnicki C. A fast taboo search algorithm for the permutation flow-shop problem. European Journal of Operational Research 91 (1996) 160-175
17. Ogbu F.A., and Smith D.K. Simulated annealing for the permutation flow shop problem. Omega 19 1 (1990) 64-67
18. Osman I.H., and Potts C.N. Simulated annealing for permutation flow-shop scheduling. Omega 17 6 (1989) 551-557
19. Palmer D.S. Sequencing jobs through a multi-stage process in the minimum total time-a quick method of obtain a near optimum. Operational Research Quarterly 16 1 (1965) 89-100
20. Rajendran C., and Chaudhuri D. Heuristic algorithms for continuous flow-shop problem. Naval Research Logistics 37 (1990) 695-705
21. Reeves C.R. Improving the efficiency of tabu search for machine sequencing problems. Journal of Operational Research Society 44 (1993) 375-382
22. Ronconi D.P. A note on constructive heuristics for the flowshop problem with blocking. International Journal of Production Economics 87 (2004) 39-48
23. Ronconi D.P. A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking. Annals of Operations Research 138 (2005) 53-65
24. Ronconi D.P., and Armentano V.A. Lower bounding schemes for flowshops with blocking in-process. Journal of Operational Research Society 52 (2001) 1289-1297
25. Taillard E. Some efficient heuristic methods for flow-shop sequencing. European Journal of Operational Research 47 (1990) 65-74
26. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993) 278-285
27. Widmer M., and Hertz A. A new heuristic method for the flow shop sequencing problem. European Journal of Operational Research 41 (1989) 186-193