Heuristics for the no-wait flow shop problem with makespan criterion

Jisuanji Xuebao/Chinese Journal of Computers

Volumn 31, Issue 7, 2008, Pages 1147-1154

  Pan, Quan Ke ^a,b   Zhao, Bao Hua ^a   Qu, Yu Gui ^a  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b LIAOCHENG UNIVERSITY   (China)

Author keywords

Anomaly; Makespan; Neighborhood search; No wait flow shop; Particle swarm optimization

Indexed keywords

MACHINE SHOP PRACTICE; NONWOVEN FABRICS; PARTICLE SWARM OPTIMIZATION (PSO);

ANOMALY; DISCRETE PARTICLE SWARM OPTIMIZATION ALGORITHM; EXPLORATION AND EXPLOITATION; MAKESPAN; MINIMIZING MAKESPAN; NEAR-OPTIMAL SOLUTIONS; NEIGHBORHOOD SEARCH; NO-WAIT FLOW SHOP;

ITERATIVE METHODS;

EID: 48549100297     PISSN: 02544164     EISSN: None     Source Type: Journal    
DOI: 10.3724/sp.j.1016.2008.01147     Document Type: Article

References (11)

1. Aldowaisan T, Allahverdi A. New heuristic for no-wait flowshops to minimize makespan. Computer and Operation Research, 2003, 30(5): 1219-1231
2. Schuster C J, Framinan J M. Approximative procedure for no-wait job shop scheduling. Operations Research Letters, 2003, 31(4): 308-18
3. Grabowski J, Pempera J. Some local search algorithms for no-wait flow-shop problem with makespan criterion. Computers and Operations Research, 2005, 32(8): 2197-2122
4. Liu B, Wang L, Jin Y H. An effective hybrid particle swarm optimization for no-wait flow shop scheduling. International Journal of Advanced Manufacturing Technology, 2007, 31(9-10): 1001-1011
5. Pan Q K, Tasgetiren M F, Liang Y C. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem with makespan criterion//Proceedings of the International Workshop on UK Planning and Scheduling Special Interest Group. London: City University, 2005: 31-41
6. Pan Q K, Tasgetiren M F, Liang Y C. Minimizing total earliness and tardiness penalties with a common due date on a single-machine using a discrete particle swarm optimization algorithm//Aat Colong Optimization and Swarm Intelligence. Lecture Notes in Computer Science 4150, 2006: 460-467
7. Pan Q K, Wang L. No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm. International Journal of Advanced Manufacturing Technology, 2007, doi:10.1007/s00170-007-1252-0
8. Spieksma F C R, Woeginger G J. The no-wait flow-shop paradox. Operations Research Letters, 2005, 33(6): 603-608
9. Kalczynski P J, Kamburowski J. On no-wait and no-idle flow shops with makespan criterion. European Journal of Operational Research, 2007, 138(3): 677-685
10. Reeves C. A genetic algorithm for flowshop sequencing. Computers and Operations Research, 1995, 22(1): 5-13
11. Heller J. Some numerical experiments for an MX J flow shop and its decision-theoretical aspects. Operations Research, 1960, 8(2): 178-184