A speed-up method for calculating total flowtime in permutation flow shop scheduling problem

2013 25th Chinese Control and Decision Conference, CCDC 2013

Volumn , Issue , 2013, Pages 2755-2758

  Duan, Jun Hua ^a   Yang, Yu Jie ^a   Gao, Kai Zhou ^a   Li, Jun Qing ^a   Pan, Quan Ke ^b  

^a LIAOCHENG UNIVERSITY   (China)

^b STATE KEY LABORATORY OF SYNTHETICAL AUTOMATION FOR PROCESS INDUSTRIES   (China)

Author keywords

Flow shop scheduling; heuristics; speed up; total flowtime

Indexed keywords

COMPUTATIONAL TIME; COMPUTING METHODS; FLOW-SHOP SCHEDULING; HEURISTICS; META HEURISTICS; PERMUTATION FLOW-SHOP SCHEDULING; SPEED-UP; TOTAL FLOWTIME;

SCHEDULING;

MACHINE SHOP PRACTICE;

EID: 84882747588     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCDC.2013.6561411     Document Type: Conference Paper

References (14)

1. Ruiz R, Maroto C. A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research 2005, 165:479-494.
2. Pan Quan-Ke, Suganthan PN, Tasgetiren MF, Chua TJ. A novel artificial bee colony algorithm for a lot-streaming flow shop scheduling problem [J]. Information sciences, 2010, DO: 10.1016/j.ins.2009.12.025.
3. Pan Quan-Ke, Wang Ling, Qian Bin. A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems [J]. Computers and Operations Research, 2009, 36(8):2498-2511.
4. Pan Quan-Ke, Tasgetiren MF, Liang YC. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem [J]. Computers and Operations Research 2008, 35(9):2807-2839.
5. Wang L, Pan QK, Suganthan PN, Wang WH, Wang YM. A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems. Computers & Operations Research, 2010, 37(3):509-520.
6. Wang L, Li BB. Quantum-inspired genetic algorithms for flow shop scheduling. In: Quantum Inspired Intelligent Systems, Nedjah N, Coelho LDS and Mourelle LDM, Eds. Berlin: Springer, 2008. Studies in Computational Intelligence (SCI), 2008, 121:17-56.
7. Pan Quan-Ke, Tasgetiren MF, Liang YC. A discrete differential evolution algorithm for the permutation flowshop scheduling problem [J]. Computers and Industrial Engineering [J], 2008, 55(4):795-816. (SCI: 381UB, EI: 20084611697561)
8. Framinan JM, Leisten R, Ruiz-Usano R. Comparison of heuristics for flowtime minimisation in permutation flowshops. Computers & Operations Research 2005, 32(5):1237-1254.
9. Li X, Wang Q, Wu C. Efficient composite heuristics for total flowtime minimization in permutation flow shops. OMEGA, The international Journal of Management Science 2009, 37:155-164.
10. Framinan JM, Leisten R, Ruiz-Usano R. Comparison of heuristics for flowtime minimisation in permutation flowshops. Computers & Operations Research 2005, 32(5):1237-1254.
11. Tang LX, Liu JY. A modified genetic algorithm for the flow shop sequencing problem to minimize mean flow time. Journal of Intelligent Manufacturing, 2002, 13(1):61-67.
12. Varadharajan, TK, Rajendran C. A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs. European Journal of Operational Research 2005, 167:772-795.
13. Nawaz M, Enscore Jr EE, Ham I. A heuristic algorithm for the m machine, n job flowshop sequencing problem. Omega-International Journal of Management Science 1983, 11(1):91-95.
14. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 1993, 47:67-74.