Scheduling dynamic hybrid flowshop with serial batching machines

Journal of the Operational Research Society

Volumn 64, Issue 6, 2013, Pages 825-832

  Xuan, H ^a   Li, B ^a  

^a ZHENGZHOU UNIVERSITY   (China)

Author keywords

batch decomposition; dynamic HFS scheduling; improved Lagrangian relaxation; MBFDP; serial batching machines

Indexed keywords

JOB SHOP SCHEDULING; LAGRANGE MULTIPLIERS; SCHEDULING;

BATCHING MACHINE; DECOMPOSITION STRATEGY; LAGRANGIAN RELAXATION; LAGRANGIAN RELAXATIONS; MBFDP; NUMERICAL EXPERIMENTS; PROCESS INDUSTRIES; SCHEDULING DYNAMICS;

DYNAMIC PROGRAMMING;

EID: 84877151461     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2012.64     Document Type: Article

References (19)

1. Akkan C and Karabati S (2004). The two-machine flowshop total completion time problem: Improved lower bounds and a branchand-bound algorithm. European Journal of Operational Research 159(2): 420-429
2. Bellanger A and Oulamara A (2009). Scheduling hybrid flowshop with parallel batching machines and compatibilities. Computers & Operations Research 36(6): 1982-1992
3. Cao Y, Xuan H and Liu J (2011). Dynamic hybrid flowshop scheduling with batching production. Applied Mechanics and Materials 65: 562-567
4. Chen HX and Luh PB (2003). An alternative framework to Lagrangian relaxation approach for job shop scheduling. European Journal of Operational Research 149(3): 499-512
5. Graham RL, Lawler EL, Lenstra JK and Rinnooy Kan AHG (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5: 287-326
6. Gu HY (2008). Computation of approximate a-points for large scale single machine scheduling problem. Computers & Operations Research 35(10): 3262-3275
7. He L, Sun S and Luo R (2007). A hybrid two-stage flowshop scheduling problem. Asia-Pacific Journal of Operational Research 24(1): 45-56
8. Irohara T (2010). Lagrangian relaxation algorithms for hybrid flow-shop scheduling problems with limited buffers. Biomedical Soft Computing and Human Science 15(1): 21-28
9. Jiang S and Tang L (2008). Lagrangian relaxation algorithms for re-entrant hybrid flowshop scheduling. 2008 International Conference on Information Management, Innovation Management and Industrial Engineering, Vol. 1, pp 78-81
10. Kim Y-D, Joo B-J and Shin J-H (2009). Heuristics for a twostage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint. Journal of Heuristics 15(1): 19-42
11. Lenstra JK, Rinnooy Kan AHG and Brucker P (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics 1: 343-362
12. Mahdavi I, Mojarad MS, Javadi B and Tajdin A (2008). A genetic approach for solving a hybrid flow shop scheduling problem. IEEE International Conference on Industrial Engineering and Engineering Management, IEEM, pp 1214-1218
13. Nishi T, Isoya Y and Inuiguchi M (2009). An integrated column generation and Lagrangian relaxation for flowshop scheduling problems. IEEE International Conference on Systems Man and Cybernetics, SMC, pp 299-304
14. Nishi T, Hiranaka Y and Inuiguchi M (2010). Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness. Computers & Operations Research 37(1): 189-198
15. Tanaka S and Araki M (2008). A branch-And-bound algorithm with Lagrangian relaxation to minimize total tardiness on identical parallel machines. International Journal of Production Economics 113(1): 446-458
16. Tang LX and Wang XP (2010). An improved particle swarm optimization algorithm for the hybrid flowshop scheduling to minimize total weighted completion time in process industry. IEEE Transactions on Control Systems Technology 18(6): 1303-1314
17. Tang LX, Xuan H and Liu JY (2007). Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling. Computers & Operations Research 34(9): 2625-2636
18. Ventura JA and Radhakrishnan S (2003). Single machine scheduling with symmetric earliness and tardiness penalties. European Journal of Operational Research 144(3): 598-612
19. Xuan H and Tang LX (2007). Scheduling a hybrid flowshop with batch production at the last stage. Computers & Operations Research 34(9): 2718-2733