Optimisation of flow-shop scheduling with batch processor and limited buffer

International Journal of Production Research

Volumn 50, Issue 8, 2012, Pages 2267-2285

  Fu, Qing ^a   Sivakumar, Appa Iyer ^a,b   Li, Kunpeng ^b,c  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b SINGAPORE MIT ALLIANCE   (Singapore)

^c HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

batch processor; differential evolution; flow shop scheduling; limited buffer

Indexed keywords

BATCH PROCESSORS; CANDIDATE SOLUTION; CONTINUOUS GENETIC ALGORITHMS; CONVERGENCE SPEED; DIFFERENTIAL EVOLUTION; DIFFERENTIAL EVOLUTION ALGORITHMS; DISCRETE PROCESSORS; FLOW SHOP SCHEDULING PROBLEM; FLOW-SHOP SCHEDULING; HEURISTICS ALGORITHM; INCOMPATIBLE JOB FAMILIES; INTERMEDIATE BUFFERS; LIMITED BUFFERS; LOWER BOUNDS; MEAN COMPLETION TIME; METAHEURISTIC; NUMERICAL EXPERIMENTS; OPTIMISATIONS; SELECTION OPERATORS; TWO-STAGE METHODS;

BATCH DATA PROCESSING; EVOLUTIONARY ALGORITHMS; SCHEDULING;

SCHEDULING ALGORITHMS;

EID: 84861362807     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2011.565813     Document Type: Article

References (25)

1. Agnetis, A., Pacciarelli, D., and Rossi, F., 1997. Batch scheduling in a two-machine flow shop with limited buffer. Discrete Applied Mathematics, 72 (3), 243-260.
2. Ahmadi, J.H., et al., 1992. Batching and scheduling jobs on batch and discrete processors. Operation Research, 40 (4), 750-763.
3. Balasubramanian, H., et al., 2004. Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness. International Journal of Production Research, 42 (8), 1621-1638.
4. Chakraborti, N., 2008. Differential Evolution: the real parameter Genetic Algorithm applied to materials and metallurgy. Kanpur Genetic Algorithms Laboratory.
5. Dobson, G. and Nambimadom, R.S., 2001. The batch loading and scheduling problem. Operations Research, 49 (1), 52-65.
6. Hall, N.G. and Sriskandarajah, C., 1996. A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44 (3), 510-525.
7. Holthaus, O. and Rajendran, C., 2002. A study on the performance of scheduling rules in buffer-constrained dynamic flowshops. International Journal of Production Research, 40 (13), 3041-3052.
8. Hoogeveen, H. and Velde, S.V.D., 1998. Scheduling by positional completion time: analysis of a two-stage flow shop problem with a batching machine. Mathematical Programming Series B, 82 (1-2), 273-289.
9. Kim, B. and Kim, S., 2002. Application of genetic algorithms for scheduling batch-discrete production system. Production Planning and Control, 13 (2), 155-165.
10. Leisten, R., 1990. Flow shop sequencing problems with limited buffer storage. International Journal of Production Research, 28 (11), 2085-2100.
11. Liu, B., Wang, L., and Jin, Y.H., 2008. An effective hybrid PSO-based algorithm for flowshop scheduling with limited buffers. Computers and Operations Research, 35 (9), 2791-2806.
12. Mathirajan, M. and Sivakumar, A.I., 2006. A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor. Internation Journal of Manufacturing Technology, 29 (9-10), 990-1001.
13. Mönch, L., et al., 2005. Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times. Computers and Operations Research, 32 (11), 2731-2750.
14. Nearchou, A.C. and Omirou, S.L., 2006. Differential evolution for sequencing and scheduling optimization. Journal of Heuristics, 12 (6), 395-411.
15. Oulamara, A., 2007. Makespan minimization in a no-wait flowshop problem with two batching machines. Computers and Operations Research, 34 (4), 1033-1050
16. Pan, Q.K., Wang, L., and Qian, B., 2009. A novel differential evolution algorithm for bi-criteria no-wait flowshop scheduling problems. Computers and Operations Research, 36 (8), 2498-2511.
17. Prins, C., 2004. A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research, 31 (12), 1985-2002.
18. Qian, B., et al., 2009. An effective hybrid DE-based algorithm for multi-objective flowshop scheduling with limited buffers. Computers and Operations Research, 36 (8), 209-233.
19. Storn, R. and Price, K., 1997. Differential Evolution-a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization, 11 (4), 241-354.
20. Sung, C.S. and Min, J.I., 2001. Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date. European Journal of Operational Research, 131 (1), 95-106.
21. Su, L.H., 2003. A hybrid two-stage flowshop with limited waiting time constraints. Computers and Industrial Engineering, 44 (3), 409-424.
22. Tasgetiren, M.F., et al., 2006. Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem. International Journal of Production Research, 22 (44), 4737-4754.
23. Tasgetiren, M.F., Pan, Q.K., and Liang, Y.C., 2009. A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times. Computers and Operation Research, 36 (6), 1900-1915.
24. Tvrdík, J., 2006. Competitive differential evolution and genetic algorithm in GA-DS toolbox. In: Technical Computing Prague, Praha, Humusoft, 99-106. Available from: http://dsp.vscht.cz/konference-matlab/MATLAB06/ prispevky/tvrdik/tvrdik.pdf.
25. Wang, L., Zhang, L., and Zheng, D.Z., 2006. An effective hybrid genetic algorithm for flowshop scheduling with limited buffers. Computers and Operations Research, 33 (10), 2960-2971.