loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Xingye Dong 1 ; Maciek Nowak 2 ; Ping Chen 3 and Houkuan Huang 4

Affiliations: 1 Beijing Jiaotong University and Loyola University, China ; 2 Loyola University, United States ; 3 NanKai University, China ; 4 Beijing Jiaotong University, China

ISBN: 978-989-8565-70-9

Keyword(s): Scheduling, Permutation Flow Shop, Total Flow Time, Iterated Local Search, Neighborhood.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Formal Methods ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Optimization Algorithms ; Planning and Scheduling ; Simulation and Modeling ; Symbolic Systems

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.

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 54.198.246.164

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
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

@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},
}

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

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.