Abstract
Iterated local search (ILS) algorithm is a powerful metaheuristic for the permutation flowshop problem with total flowtime objective. ILS is based on a local search procedure and the procedure needs to be restarted from another solution when the procedure is trapped into a local optima. In the literature, the solution is often generated by slightly perturbing the best solution found so far. By doing so, the search space is relatively narrow and it is easy to lead the search stagnant. In order to improve this situation, a strategy is proposed in this paper to allow the restart solution be generated from a group of solutions, which are drawn from the local optima solutions found in the search process. An ILS algorithm named MRSILS is proposed. Its performance is evaluated on a set of benchmarks. Comparisons show that the MRSILS is significantly better than or comparable to several state-of-the-art metaheuristics.
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, 61–68 (1954)
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)
Zhang, Y., Li, X.P., Wang, Q.: Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization. European Journal of Operational Research 196, 869–876 (2009)
Tseng, L.-Y., Lin, Y.-T.: A hybrid genetic local search algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 198, 84–92 (2009)
Tseng, L.-Y., Lin, Y.-T.: A genetic local search algorithm for minimizing total flowtime in the permutation flowshop scheduling problem. International Journal of Production Economics 127, 121–128 (2010)
Jarboui, B., Eddaly, M., Siarry, P.: An estimation of distributation algorithm for minimizing the total flowtime in permutation flowshop scheduling problems. Computers and Operations Research 36, 2638–2646 (2009)
Pan, Q.-K., Tasgetiren, M.F., Liang, Y.-C.: A discrete differential evolution algorithm for the permutation flowshop scheduling problem. Computers and Industrial Engineering 55, 795–816 (2008)
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)
Tasgetiren, M.F., Pan, Q.-K., Suganthan, P.N., Chen, A.H.-L.: A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops. Information Sciences 181, 3459–3475 (2011)
Ruiz, R., Stützle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 177, 2033–2049 (2007)
Chen, P., Huang, H., Dong, X.: Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem. Expert Systems with Applications 37, 1620–1627 (2010)
Pinedo, M.: Scheduling: theory, algorithms, and systems, 2nd edn. Prentice-Hall (2001)
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)
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., Chen, P., Huang, H. (2011). An Improved Iterated Local Search Algorithm for the Permutation Flowshop Problem with Total Flowtime. In: Lee, G. (eds) Advances in Automation and Robotics, Vol.1. Lecture Notes in Electrical Engineering, vol 122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25553-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-25553-3_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25552-6
Online ISBN: 978-3-642-25553-3
eBook Packages: EngineeringEngineering (R0)