Scheduling jobs on a k-stage flexible flow-shop

Annals of Operations Research

Volumn 164, Issue 1, 2008, Pages 29-40

  Paternina Arboleda, Carlos D ^a   Montoya Torres, Jairo R ^b   Acero Dominguez, Milton J ^a   Herrera Hernandez, Maria C ^a  

^a UNIVERSIDAD DEL NORTE   (Colombia)

^b UNIVERSIDAD DE LA SABANA   (Colombia)

Author keywords

Computational experiments; Flexible flow shop; Heuristic

Indexed keywords

EID: 57849086173     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-007-0257-2     Document Type: Article

References (38)

1. Acero, M., Montoya-Torres, J. R., & Paternina-Arboleda, C. D. (2004). Scheduling jobs on a k-stage flexible flow shop. In A. Oulamara & M. C. Portmann (Eds.), Proceedings of the ninth international workshop on project management and scheduling (pp. 242-245).
2. H. Allaoui A. Artiba 2006 Scheduling two-stage hybrid flow shop with availability constraints Computer and Operation Research 33 1399 1419
3. M. Azizoglu E. Cakmak S. Kondakci 2001 A flexible flowshop problem with total flow time minimization European Journal of Operational Research 132 528 538
4. S. Bertel J. C. Billaut 2004 A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation European Journal of Operational Research 159 651 662
5. V. Botta-Genoulaz 2000 Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness International Journal of Production Economics 64 101 111
6. S. A. Brah J. L. Hunsucker 1991 Branch and bound algorithm for the flow shop with multiple processors European Journal of Operation Research 51 88 99
7. Chen, B. (1994). Scheduling multiprocessor flowshops. In Advances in optimization and approximation. Dordrecht: Kluwer.
8. B. Chen 1995 Analysis of classes of heuristics for scheduling a two-stage flow shop with parallel machines at one stage Journal of the Operational Research Society 46 234 244
9. M. Dessouky M. Dessouky S. Verma 1998 Flowshop scheduling with identical jobs and uniform parallel machines European Journal of Operational Research 109 620 631
10. H. Djellab K. Djellab 2002 Preemptive hybrid flowshop scheduling problem of interval orders European Journal of Operational Research 137 37 49
11. R. Fisher L. Tippett 1928 Limiting forms of the frequency distribution of the largest or smallest member of a sample Proceedings of the Cambridge Philosophical Society 24 180 190
12. Ghashghai, E., & Rardin, R. L. (1998). Using a hybrid of exact and genetic algorithms to design survivable networks. In Working paper school of industrial engineering, Purdue University.
13. Goldratt, E., & Cox, J. (1992). The goal. North River Press.
14. A. Guinet M. Solomon 1996 Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time International Journal of Production Research 34 1643 1654
15. J. Gupta 1988 Two stage hybrid flow shop scheduling problem Journal of the Operations Research Society 38 359 364
16. M. Haouari R. M'Hallah 1997 Heuristic algorithms for the two-stage hybrid flowshop problem Operations Research Letters 21 43 53
17. Z. Jin Z. Yang T. Ito 2006 Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem International Journal of Production Economics 100 322 334
18. Jungwattanakit, J., Reodecha, M., Chaovalitwongse, P., & Werner, F. (2006). Sequencing heuristics for flexible flow shop problems with unrelated parallel machines and setup times. In Proceedings of the 2006 IE network national conference, Bangkok, 18-19 December 2006 (Session F53, pp. 1-8).
19. C. Y. Lee G. Vairaktarakis 1994 Minimizing makespan in hybrid flowshops Operations Research Letters 16 149 158
20. R. Linn W. Zhang 1999 Hybrid flow shop scheduling: A survey Computers and Industrial Engineering 37 57 61
21. O. Moursli Y. Pochet 2000 A branch and bound algorithm for the hybrid flow shop International Journal of Production Economics 64 113 125
22. C. Oguz Y. Zinder V. H. Dob A. Janiak M. Lichtenstein 2004 Hybrid flow shop scheduling problems with multiprocessor task systems European Journal of Operational Research 152 115 131
23. I. M. OvacIk S. Rajagopalan R. Uzsoy 2000 Integrating interval estimates of global optima and local search methods for combinatorial optimisation problems Journal of Heuristics 6 481 500
24. Pinedo, M. (1994). Scheduling: Theory, algorithms, and systems. Englewood Cliffs: Prentice-Hall.
25. M. C. Portmann A. Vignier D. Dardilhac D. Dezalay 1998 Branch and bound crossed with GA to solve hybrid flowshops European Journal of Operational Research 107 389 400
26. R. L. Rardin R. Uzsoy 2001 Experimental evaluation of heuristic optimisation algorithms: A tutorial Journal of Heuristics 7 261 304
27. F. Riane A. Artiba S. E. Elmaghraby 1998 A hybrid three-stage flexible flowshop problem: Efficient heuristics to minimize makespan European Journal of Operational Research 109 321 329
28. F. Riane A. Artiba S. Iassinovski 2001 An integrated production planning and scheduling system for hybrid flowshop organizations International Journal of Production Economics 74 33 48
29. R. Ruíz C. Maroto 2006 A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility European Journal of Operational Research 169 781 800
30. D. L. Santos J. L. Hunsucker D. E. Deal 1995 Global lower bounds for flowshops with multiple processors European Journal of Operational Research 80 112 120
31. T. Sawik 2002 An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers Mathematical and Computer Modelling 36 461 471
32. F. Sivrikaya Serifoglu G. Ulusoy 2004 Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach Journal of the Operational Research Society 55 504 512
33. H. Soewandi S. E. Elmaghraby 2001 Sequencing three-stage flexible flowshops with identical machines to minimize makespan IIE Transactions 33 985 993
34. C. Sriskandarajah E. Wagneur 1991 Hierarchical control of the two processor flow-shop with state dependent processing times: Complexity analysis and approximate algorithms INFOR, Canadian Journal of Information Systems and Operational Research 29 193 205
35. L. Tang H. Xuan J. Liu 2006 A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time Computers and Operations Research 33 3344 3359
36. Vignier, A., Commandeur, P., & Proust, C. (1997). New lower bound for the hybrid flowshop scheduling problem. In Proceedings of the 1997 IEEE conference on emerging technologies and factory automation (pp. 446-451).
37. H. Xuan L. Tang 2007 Scheduling a hybrid flowshop with batch production at the last stage Computers and Operations Research 34 2718 2733
38. S. H. Zanakis 1979 A simulation study of some simple estimators of the three-parameter Weibull distribution Journal of Statistical Computing and Simulation 9 419 428