Enhanced Iterated Local Search Algorithms for the Permutation Flow Shop Problem Minimizing Total Flow Time

Xingye Dong, Maciek Nowak, Ping Chen, Houkuan Huang

Abstract

Flow shop scheduling minimizing total flow time is a famous combinatorial optimization problem. Many algorithms have been proposed to solve it. Among them, iterated local search (ILS) is a simple, efficient and effective one. However, in existing ILS, one basic insertion neighborhood is generally used, greatly limiting the search space. In this work, an enhanced iterated local search (EILS) is proposed, using a hybrid of insertion and swap neighborhoods. The perturbation method also plays an important role in ILS. Two perturbation methods, the insertion method and a destruction and construction heuristic are tested in this paper. Both perform significantly better in comparison to three state of the art algorithms, indicating that the hybrid use of insertion and swap neighborhoods is effective for the discussed problem. However, there is no significant difference between the destruction and construction and the insertion perturbation methods.

References

  1. Dong, X., Chen, P., Huang, H., and Nowak, M. (2013). A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time. Computers and Operations Research, 40:627- 632.
  2. Dong, X., Huang, H., and Chen, P. (2009). An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion. Computers and Operations Research, 36:1664-1669.
  3. Garey, M., Johnson, D., and Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1:117-129.
  4. Johnson, S. (1954). Optimal two and three-stage production schedule with setup times included. Naval Research Logistics Quarterly, 1(1):61-68.
  5. Liu, J. and Reeves, C. (2001). Constructive and composite heuristic solutions to the p== å ci scheduling problem. European Journal of Operational Research, 132:439- 452.
  6. Lourenc¸o, H., Martin, O., and Stützle, T. (2010). Handbook of Metaheuristics, volume 146 of International Series in Operations Research & Management Science, chapter Iterated Local Search: Framework and Applications, pages 363-397. Springer US.
  7. Pan, Q.-K. and Ruiz, R. (2012). Local search methods for the flowshop scheduling problem with flowtime minimization. European Journal of Operational Research, 222:31-43.
  8. Pan, Q.-K., Tasgetiren, M., and Liang, Y.-C. (2008). A discrete differential evolution algorithm for the permutation flowshop scheduling problem. Computers and Industrial Engineering, 55:795-816.
  9. Pinedo, M. (2001). Scheduling: theory, algorithms, and systems. Prentice Hall, 2nd edition.
  10. Rajendran, C. and Ziegler, H. (1997). An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs. European Journal of Operational Research, 103:129-138.
  11. Rajendran, C. and Ziegler, H. (2004). Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. European Journal of Operational Research, 155:426-438.
  12. Rajendran, C. and Ziegler, H. (2005). Two ant-colony algorithms for minimizing total flowtime in permutation flowshops. Computers and Industrial Engineering, 48:789-797.
  13. Ruiz, R. and St ützle, T. (2007). A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research, 177:2033-2049.
  14. Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64:278-285.
  15. Tasgetiren, M., Pan, Q.-K., Suganthan, P., and Chen, A. H.-L. (2011). A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops. Information Sciences, 181:3459- 3475.
  16. Tseng, L.-Y. and Lin, Y.-T. (2009). A hybrid genetic local search algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research, 198:84-92.
  17. Tseng, L.-Y. and Lin, Y.-T. (2010). A genetic local search algorithm for minimizing total flowtime in the permutation flowshop scheduling problem. International Journal of Production Economics, 127:121-128.
  18. Zhang, Y., Li, X., and Wang, Q. (2009). Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization. European Journal of Operational Research, 196(3):869-876.
Download


Paper Citation


in Harvard Style

Dong X., Nowak M., Chen P. and Huang H. (2013). Enhanced Iterated Local Search Algorithms for the Permutation Flow Shop Problem Minimizing Total Flow Time . In Proceedings of the 10th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-989-8565-70-9, pages 58-65. DOI: 10.5220/0004410100580065


in Bibtex Style

@conference{icinco13,
author={Xingye Dong and Maciek Nowak and Ping Chen and Houkuan Huang},
title={Enhanced Iterated Local Search Algorithms for the Permutation Flow Shop Problem Minimizing Total Flow Time},
booktitle={Proceedings of the 10th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2013},
pages={58-65},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004410100580065},
isbn={978-989-8565-70-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 10th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - Enhanced Iterated Local Search Algorithms for the Permutation Flow Shop Problem Minimizing Total Flow Time
SN - 978-989-8565-70-9
AU - Dong X.
AU - Nowak M.
AU - Chen P.
AU - Huang H.
PY - 2013
SP - 58
EP - 65
DO - 10.5220/0004410100580065