Abstract
Iterated Local Search (ILS) is a simple and efficient algorithm, which has been used to solve many combinatorial optimization problems. However, the effect of different search sequences in the local search procedure has not been studied. In this work, we used the ILS algorithm to solve the permutation flowshop scheduling problem with total flowtime objective, and observe the effect of different search sequences on this problem. Experimental results on benchmarks show that the search sequence does have some effect, though sometimes the effect may be little. If the iteration number is not so large, then the performance is better by changing the search sequence to the best solution found in the search process when the search process is trapped into local optimum. If the iteration number is rather large, then the performance is better by changing the search sequence to the best solution found in the search process immediately. Comparisons on benchmarks also show that ILS is comparable to the state of the art metaheuristics.
This work is supported by The Fundamental Research Funds for the Central Universities (Project Ref. 2009JBM018, Beijing Jiaotong University).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Johnson, S.M.: Optimal two and three-stage production schedule with setup times included. Naval Research Logistics Quarterly 1(1), 61–68 (1954)
Liu, J.Y., Reeves, C.R.: Constructive and composite heuristic solutions to the P// ∑ C i scheduling problem. European Journal of Operational Research 132, 439–452 (2001)
Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1, 117–129 (1976)
Rajendran, C., Ziegler, H.: Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. European Journal of Operational Research 155, 426–438 (2004)
Rajendran, C., Ziegler, H.: Two ant-colony algorithms for minimizing total flowtime in permutation flowshops. Computers and Industrial Engineering 48, 789–797 (2005)
Tasgetiren, M.F., Liang, Y.-C., Sevkli, M., Gencyilmaz, G.: A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European Journal of Operational Research 177, 1930–1947 (2007)
Dong, X.Y., Huang, H.K., Chen, P.: An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion. Computers and Operations Research 36, 1664–1669 (2009)
Tseng, L., Lin, Y.: A hybrib genetic local search algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 198, 84–92 (2009)
Tseng, L., Lin, Y.: A genetic local search algorithm for minimizing total flowtime in the permutation flowshop scheduling problem. Int. J. Production Economics 127, 121–128 (2010)
Zhang, Y., Li, X., Wang, Q.: Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization. European Journal of Operational Research 196, 869–878 (2009)
Martin, O., Otto, S.W., Felten, E.W.: Large-step markov chains for the traveling salesman problem. Complex Systems 5(3), 299–326 (1991)
Martin, O., Otto, S.W.: Combining simulated annealing with local search heuristics. Annals of Operations Research 63, 57–75 (1996)
Lourenco, H.R.: Job-shop scheduling: computational study of local search and large-step optimization methods. European Journal of Operational Research 83, 347–364 (1995)
Hashimoto, H., Yagiura, M., Ibaraki, T.: An iterated local search algorithm for the time-dependent vehicle routing problem with time windows. Discrete Optimization 5, 434–456 (2008)
Laurent, B., Hao, J.K.: Iterated local search for the multiple depot vehicle scheduling problem. Computers and Industrial Engineering 57, 277–286 (2009)
Stützle, T.: Applying iterated local search to the permutation flow shop problem. Technical Report, AIDA-98-04, FG Intellektik, TU Darmstadt
Pinedo, M.: Scheduling: theory, algorithms, and systems, 2nd edn. Prentice-Hall, Englewood Cliffs (2001)
Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research 64, 278–285 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dong, X., Huang, H., Chen, P. (2011). Study on Iterated Local Search Algorithm for Permutation Flowshop Problem with Total Flowtime Objective. In: Zeng, D. (eds) Applied Informatics and Communication. ICAIC 2011. Communications in Computer and Information Science, vol 225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23220-6_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-23220-6_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23219-0
Online ISBN: 978-3-642-23220-6
eBook Packages: Computer ScienceComputer Science (R0)