A scatter search algorithm for a multistage production scheduling problem with blocking and semi-continuous batching machine

IEEE Transactions on Control Systems Technology

Volumn 19, Issue 5, 2011, Pages 976-989

  Tang, Lixin ^a   Wang, Xianpeng ^a  

^a NORTHEASTERN UNIVERSITY   (China)

Author keywords

Blocking; mixed integer linear programming (MILP) model; multistage production scheduling; scatter search; semi continuous batching machine

Indexed keywords

BLOCKING; MIXED INTEGER LINEAR PROGRAMMING MODEL; MULTISTAGE PRODUCTION; SCATTER SEARCH; SEMI-CONTINUOUS;

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; HOT ROLLING; INTEGER PROGRAMMING; IRON AND STEEL PLANTS; LINEAR PROGRAMMING; PRODUCTION ENGINEERING; SCHEDULING ALGORITHMS; STEELMAKING; SUPPLY CHAIN MANAGEMENT;

IRON AND STEEL INDUSTRY;

EID: 80051903961     PISSN: 10636536     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCST.2010.2060201     Document Type: Article

References (35)

1. M. Dawande, J. Kalagnanam, H. S. Lee, C. Reddy, S. Siegel, and M. Trumbo, "The slab design problem in the steel industry," Interfaces, vol. 34, no. 3, pp. 215-225, 2004.
2. B. Bona, P. Brandimarte, C. Greco, and G. Menga, "Hybrid hierarchical scheduling and control systems in manufacturing," IEEE Trans. Robot. Autom., vol. 6, no. 6, pp. 673-686, Dec. 1990.
3. J. C. Ammons, T. Govindaraj, and C. M. Mitchell, "Decision models for aiding FMS scheduling and control," IEEE Trans. Syst., Man, Cybern., vol. 18, no. 5, pp. 744-756, Sep./Oct. 1988.
4. L. X. Tang and X. P. Wang, "A predictive reactive scheduling method for color-coating production in steel industry," Int. J. Adv. Manuf. Technol., vol. 35, no. 7-8, pp. 633-645, 2008.
5. N. G. Hall and C. Sriskandarajah, "A survey of machine scheduling problems with blocking and no-wait in process," Oper. Res., vol. 44, no. 3, pp. 510-525, 1996. (Pubitemid 126669516)
6. E. D. Kosiba, J. R. Wright, and A. E. Cobbs, "Discrete event sequencing as a traveling salesman problem," Comput. Ind., vol. 19, no. 3, pp. 317-327, 1992.
7. L. Lopez, M. W. Carter, and M. Gendreau, "The hot strip mill production scheduling problem: A tabu search approach," Euro. J. Operat. Res., vol. 106, no. 2-3, pp. 317-335, 1998. (Pubitemid 128399655)
8. L. X. Tang, J. Y. Liu, A. Y. Rong, and Z. H. Yang, "Multiple traveling salesman problem model for hot scheduling in Shanghai Baoshan Iron & Steel Complex," Euro. J. Oper. Res., vol. 124, no. 2, pp. 267-282, 2000.
9. P. Cowling, "A flexible decision support system for steel hot rolling mill scheduling," Comput. Ind. Eng., vol. 45, no. 2, pp. 307-321, 2003.
10. X. P. Wang and L. X. Tang, "Integration of batching and scheduling for hot rolling production in the steel industry," Int. J. Adv. Manuf. Technol., vol. 36, no. 5-6, pp. 431-441, 2008.
11. C. Aurora, D. Cettolo, and F. A. Cuzzola, "Cut scheduling optimization in plate mill finishing area through mixed-integer linear programming," IEEE Trans. Control Syst. Technol., vol. 18, no. 1, pp. 118-127, Jan. 2010.
12. L. X. Tang and X. P. Wang, "A two phase heuristic for the production scheduling of heavy plates in steel industry," IEEE Trans. Control Syst. Technol., vol. 18, no. 1, pp. 104-117, Jan. 2010.
13. C. Y. Lee, R. Uzsoy, and L. A. Martin-Vega, "Efficient algorithms for scheduling semiconductor burn-in operations," Oper. Res., vol. 40, no. 4, pp. 764-775, 1992. (Pubitemid 23581869)
14. C. S. Sung, Y. I. Choung, J. M. Hong, and Y. H. Kim, "Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals," Comput. Oper. Res., vol. 29, no. 8, pp. 995-1007, 2002. (Pubitemid 34196076)
15. C. S.Wang and R. Uzsoy, "A genetic algorithm to minimize maximum lateness on a batch processing machine," Comput. Oper. Res., vol. 29, no. 12, pp. 1621-1640, 2002. (Pubitemid 34589742)
16. L. X. Tang and Y. F. Zhao, "Scheduling a single semi-continuous batching machine," Omega, vol. 36, no. 6, pp. 992-1004, 2008.
17. T. Shima, S. Rasmussen, and D. Gross, "Assigning micro UAVs to task tours in an urban terrain," IEEE Trans. Control Syst. Technol., vol. 15, no. 4, pp. 601-611, Jul. 2007.
18. D. Y. Lee and F. DiCesare, "Scheduling flexible manufacturing systems using petri nets and heuristic search," IEEE Trans. Robot. Autom., vol. 10, no. 2, pp. 123-132, Apr. 1994.
19. B. I. Kim, S. S. Heragu, R. J. Graves, and A. S. Onge, "A hybrid scheduling and control system architecture for warehouse management," IEEE Trans. Robot. Autom., vol. 19, no. 6, pp. 991-1001, Dec. 2003.
20. E. Nowicki and C. Smutnicki, "Some aspects of scatter search in the flow-shop problem," Euro. J. Oper. Res., vol. 169, no. 2, pp. 654-666, 2006. (Pubitemid 41375713)
21. R. Ruiz and C. Maroto, "A comprehensive review and evaluation of permutation flowshop heuristics," Euro. J. Oper. Res., vol. 165, no. 2, pp. 479-494, 2005. (Pubitemid 40206377)
22. F. Glover, "Heuristics for integer programming using surrogate constraints," Decision Sci., vol. 8, no. 1, pp. 156-166, 1977.
23. R. R. Martí, M. Laguna, and F. Glover, "Principles of scatter search," Euro. J. Oper. Res., vol. 169, no. 2, pp. 359-372, 2006. (Pubitemid 41375696)
24. C. Koulamas, "A new constructive heuristic for the flowshop scheduling problem," Euro. J. Oper. Res., vol. 105, no. 1, pp. 66-71, 1998. (Pubitemid 128387761)
25. D. Palmer, "Sequencing jobs through a multi-stage process in the minimum total time-A quick method of obtaining a near optimum," Oper. Res. Quarterly, vol. 16, no. 1, pp. 101-107, 1965.
26. J. N. G. Gupta, "Heuristic algorithms for multistage flowshop scheduling problem," AIIE Trans., vol. 4, no. 1, pp. 11-18, 1972.
27. M. Nawaz, E. E. Enscore, and I. Ham, "A heuristic algorithm for the m-machine, n-job flow shop sequencing problem," OMEGA, vol. 11, no. 1, pp. 91-95, 1983. (Pubitemid 13193807)
28. N. Mladenovic, "Variable neighborhood search," Comput. Oper. Res., vol. 24, no. 11, pp. 1097-1100, 1997.
29. R. Ruiz and T. Stützle, "A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem," Euro. J. Oper. Res., vol. 177, no. 3, pp. 2033-2049, 2007. (Pubitemid 44712036)
30. M. F. Tasgetiren, Y. C. Liang, M. Sevkli, and G. Gencyilmaz, "A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem," Euro. J. Oper. Res., vol. 177, no. 3, pp. 1930-1947, 2007. (Pubitemid 44780934)
31. D. C. Montgomery, Design and Analysis of Experiments, 5th ed. New York: Wiley, 2000.
32. E. Taillard, "Benchmarks for basic scheduling problems," Euro. J. Oper. Res., vol. 64, no. 2, pp. 278-285, 1993. (Pubitemid 23599340)
33. D. P. Ronconi, "A branch-And-bound algorithm to minimize the makespan in a flowshop with blocking," Annals Oper. Res., vol. 138, no. 1, pp. 53-65, 2005. (Pubitemid 41241790)
34. V. Caraffa, S. Ianes, T. P. Bagchi, and C. Sriskandarajah, "Minimizing makespan in a blocking flowshop using genetic algorithms," Int. J. Prod. Econom., vol. 70, no. 2, pp. 101-115, 2001. (Pubitemid 32264325)
35. J. Grabowski and J. Pempera, "The permutation flow shop problem with blocking. A tabu search approach," Omega, vol. 35, no. 3, pp. 302-311, 2007. (Pubitemid 44317633)