Similarity based Ant-colony algorithm for permutation flowshop scheduling problems with total flowtime minimization

Proceedings of the 2009 13th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2009

Volumn , Issue , 2009, Pages 582-589

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

^a SOUTHEAST UNIVERSITY   (China)

Author keywords

Ant colony algorithm; Permutation flowshop; Scheduling; Similarity; Total flowtime

Indexed keywords

ANT-COLONY ALGORITHM; CONSTRUCTION METHOD; EFFECTIVE ALGORITHMS; NEW SOLUTIONS; NP-HARD; PERMUTATION FLOWSHOP; PERMUTATION FLOWSHOP SCHEDULING PROBLEMS; SIMILARITY; SPACE MAPPINGS; TOTAL FLOWTIME;

COMPUTATIONAL COMPLEXITY; GROUPWARE; INTERACTIVE COMPUTER SYSTEMS;

SCHEDULING ALGORITHMS;

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

References (15)

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. Rinnooy Kan, A.H.G. Machine Scheduling Problems: Classification, Complexity and Computations. Martinus Nijhoff. 1976; The Hague. The Netherlands.
4. 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. (Pubitemid 127396735)
5. Liu J, Reeves CR. Constructive and composite heuristic solutions to the P//,£Ci scheduling problem. European Journal of Operational Research. 2001; 132:439-452. (Pubitemid 32385032)
6. AlIahverdi A, Aldowaisan T. New heuristics to minimize total completion time in m-machine flowshops. international Journal of Production Economics. 2002; 77(1): 71-83. (Pubitemid 34284488)
7. Li Xiaoping, Wang Qian, Wu Cheng. Efficient Composite Heuristics for Total Flowtime Minimization in Permutation Flow Shops. Omega, 2009; 37(1): 155-164.
8. Tailard E. Benchmarks for basic scheduling problems. European Journal of Operational Research. 1993; 64(1):278-285.
9. Ruiz R, Stiitzle T. a simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research. 2007; 177: 2033-2049. (Pubitemid 44712036)
10. Ruiz R, Stiitzle T. An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. European Journal of Operational Research. 2008; 187: 1143-1159. (Pubitemid 350245722)
11. Dong X., Huang H. and Chen P.. An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion. Computers & Operations Research (2008), doi: 10. 10 16/j.cor.2008.04.001.
12. Zhang Y., Li X., Wang Q.. Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization. European Journal of Operational Research (2008), doi: 10.1016/j.ejor. 2008.04.033.
13. Geraldo RF, MarceloSN and Luiz ANL. Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop. Lecture Notes in Computer Science. 2007; 4771: 69-81.
14. Rajendran C, Ziegler H. Ant-colony algorithms for permutation flowshop scheduling to minimize make span-total flowtime of jobs. European Journal of Operation Research. 2004; 115 :426-438.
15. Rajendran C, Ziegler H. Two ant-colony algorithms for minimizing total flowtime in permutation flowshops. Computers & industrial Engineering. 2005; 48: 789-797. (Pubitemid 40391497)