Composite heuristic algorithm for permutation flowshop scheduling problems with total flowtime minimization

Proceedings of the 2008 12th International Conference on Computer Supported Cooperative Work in Design, CSCWD

Volumn 2, Issue , 2008, Pages 903-907

  Zhang, Yi ^a   Li, Xiaoping ^a   Zhu, Jie ^a   Wang, Qian ^a  

^a Ministry of Education   (China)

Author keywords

Composite heuristic algorithm; Permutation flowshop; Scheduling; Total flowtime

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTER NETWORKS; GROUPWARE; HEURISTIC METHODS; HEURISTIC PROGRAMMING; INTERACTIVE COMPUTER SYSTEMS; NUCLEAR PROPULSION; OPTIMIZATION; PERTURBATION TECHNIQUES; PORTALS; SCHEDULING;

COMPOSITE HEURISTIC ALGORITHM; INTERNATIONAL CONFERENCES; PERMUTATION FLOW-SHOP SCHEDULING; PERMUTATION FLOWSHOP; TOTAL FLOWTIME;

HEURISTIC ALGORITHMS;

EID: 51049087261     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSCWD.2008.4537099     Document Type: Conference Paper

References (16)

1. French S. Sequencing and scheduling: an introduction to the mathematics of the job-shop. Chichester: Ellis Horwood, 1982.
2. Rajendran C. A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria. International Journal of Production Research. 1994; 32:2541-2558.
3. Gray MR, Johnson DS, Sethi R. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research. 1976; 1(2): 117-129.
4. Woo DS, Yim HS. A heuristic algorithm for mean flowtime objective in flowshop scheduling. Computers & Operations Research. 1998; 25(3): 175-182.
5. Rajendran C, Ziegler H. An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs. European Journal of Operational Research. 1997; 103(1): 129-138.
6. i scheduling problem. European Journal of Operational Research. 2001; 132:439-452.
7. Framinan JM, Leisten R. An efficient constructive heuristic for flowtime minimisation in permutation flow shops. OMEGA. 2003; 31(4): 311-317.
8. Allahverdi A, Aldowaisan T. New heuristics to minimize total completion time in m-machine flowshops. International Journal of Production Economics. 2002; 77(1): 71-83.
9. Framinan JM, Leisten R, Ruiz-Usano R. Comparison of heuristics for flowtime minimisation in permutation flowshops. Computers & Operations Research. 2005; 32: 1237-1254.
10. Li Xiaoping, Wang Qian, Wu Cheng. Efficient Composite Heuristics for Total Flowtime Minimization in Permutation Flow Shops. OMEGA, to appear.
11. Rajendran C, Ziegler H. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan_total flowtime of jobs. European Journal of Operation Research. 2004; 115:426-438.
12. Rajendran C, Ziegler H. Two ant-colony algorithms for minimizing total flowtime in permutation flowshops. Computers & Industrial Engineering. 2005. 48: 789-797.
13. Tasgetiren M. Fatih, Liang Yun-Chia, Sevkli Mehmet, Gencyilmaz Gunes. A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European Journal of Operational Research. 2007; 177: 1930-1947.
14. Tailard E. Benchmarks for basic scheduling problems. European Journal of Operational Research. 1993; 64(1):278-285.
15. Ruiz R, Maroto C, Alcaraz J. Two new robust genetic algorithms for the flowshop scheduling problem. OMEGA. 2006; 34: 461-476.
16. Ruiz R, Stützle T. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research. 2007. 177: 2033-2049.