An effective neighborhood search algorithm for scheduling a flow shop of batch processing machines

Computers and Industrial Engineering

Volumn 61, Issue 3, 2011, Pages 739-743

  Lei, Deming ^a   Wang, Tao ^a  

^a WUHAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Batch processing machines; Flow shop scheduling; Neighborhood search; Permutation

Indexed keywords

BATCH PROCESSING MACHINE; COMPUTATIONAL RESULTS; FLOW-SHOP SCHEDULING; FLOW-SHOPS; MAXIMUM LATENESS; NEIGHBORHOOD SEARCH; NEIGHBORHOOD SEARCH ALGORITHMS; NEW SOLUTIONS; PERMUTATION; SCHEDULING PROBLEM; SUB-PROBLEMS;

LEARNING ALGORITHMS; MACHINE SHOP PRACTICE; SCHEDULING ALGORITHMS;

BATCH DATA PROCESSING;

EID: 80053211943     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2011.05.005     Document Type: Article

References (13)

1. M.R. Amin-Naseri, and M. Beheshti-Nia Hybrid flow shop scheduling with parallel batching International Journal of Production Economics 117 2009 185 196
2. P. Damodaran, and K. Srihari Mixed integer formulation to minimize makespan in a flow shop with batch processing machines Mathematical and Computer Modelling 40 2004 1465 1472 (Pubitemid 40607890)
3. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan Optimization and approximation in deterministic machine scheduling: A survey Annals of Discrete Mathematics 5 1979 287 326
4. A.H. Kashan, and B. Karimi An improved mixed integer linear formulation and lower bounds for minimizing makespan on a flow shop with batch processing machines International Journal of Advanced Manufacturing Technology 40 2009 582 594
5. D.M. Lei, and X.P. Guo Variable neighborhood search for minimizing tardiness objectives on flow shop with batch processing machines International Journal of Production Research 49 2011 519 529
6. Lei, D. M.; Wang, T.; Chen, W.; Zhang, Q. F.; & Guo, X. P. (2010). Genetic algorithm based multi-objective scheduling in a flow shop with batch processing machines In Proceedings of 8th world congress on intelligent control and automation (pp. 694-699).
7. Liao, L. M.; & Huang, C. J. (in press). Tabu search heuristic for two-machine flow shop with batch processing machines. Computers and Industrial Engineering.
8. P.K. Manjeshwar, P. Damodaran, and K. Srihari Minimizing makespan in a flow shop with two batch-processing machines using simulated annealing Robotics and Computer-Integrated Manufacturing 25 2009 667 679
9. H.S. Mirsanei, B. Karimi, and F. Jolai Flow shop scheduling with two batch processing machines and nonidentical job sizes International Journal of Advanced Manufacturing Technology 45 2009 553 572
10. A. Oulamara Makespan minimization in a no-wait flow shop problem with two batching machines Computers and Operations Research 34 2007 1033 1050 (Pubitemid 44402890)
11. C.S. Sung, Y.H. Kim, and S.H. Yoon A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines European Journal of Operational Research 121 2000 179 192 (Pubitemid 30546354)
12. C.S. Sung, and J.I. Min Scheduling in a two-machine flowshop with batch processing machines for earliness/tardiness measure under a common due date European Journal of Operational Research 131 2001 95 106 (Pubitemid 32264918)
13. A.D. Yimer, and K. Demirli Fuzzy scheduling of job orders in a two-stage flowshop with batch-processing machines International Journal of Approximate Reasoning 50 2009 117 137