Abstract
In this work, we consider the integrated lot-sizing and sequencing problem in a permutation flow shop with machine sequence-dependent setups. The problem is to determine the lot sizes and the production sequence in each period of a planning horizon such that the customer demands must be met and the capacity of the machines must be respected. The objective is to determine the sum of the setup costs, the production costs and the inventory costs over the planning horizon. Due to the complexity of the problem, we propose a heuristic based on Iterated Greedy metaheuristic which uses sequencing and lot-sizing decisions. The proposed method is compared against the best heuristics available in the literature in a large set of problem instances. Comprehensive computational and statistical analyses are carried out in order to validate the performance of the proposed heuristic.
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
Pochet, Y., Wolsey, L.A.: Production planning by mixed integer programming. Springer (2006)
Barany, I., Van Roy, T.J., Wolsey, L.A.: Strong formulations for multi-item capacitated lot sizing. Management Science 30(10), 1255–1261 (1984)
Almada-Lobo, B., Klabjan, D., Antónia Carravilla, M., Oliveira, J.F.: Single machine multi-product capacitated lot sizing with sequence-dependent setups. International Journal of Production Research 45(20), 4873–4894 (2007)
Almada-Lobo, B., James, R.J.: Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups. International Journal of Production Research 48(3), 861–878 (2010)
Drexl, A., Kimms, A.: Lot sizing and scheduling survey and extensions. European Journal of Operational Research 99(2), 221–235 (1997)
Toledo, C., Frana, P., Morabito, R., Kimms, A.: Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem. International Journal of Production Research 47(11), 3097–3119 (2009)
Karimi, B., Ghomi, S.F., Wilson, J.: The capacitated lot sizing problem: A review of models and algorithms. Omega 31(5), 365–378 (2003)
Clark, A.R., Clark, S.J.: Rolling-horizon lot-sizing when set-up times are sequence-dependent. International Journal of Production Research 38(10), 2287–2307 (2000)
Zhu, X., Wilhelm, W.E.: Scheduling and lot sizing with sequence-dependent setup: A literature review. IIE Transactions 38(11), 987–1007 (2006)
Sikora, R., Chhajed, D., Shaw, M.J.: Integrating the lot-sizing and sequencing decisions for scheduling a capacitated flow line. Computers & Industrial Engineering 30(4), 659–679 (1996)
Sikora, R.: A genetic algorithm for integrating lot-sizing and sequencing in scheduling a capacitated flow line. Computers & Industrial Engineering 30(4), 969–981 (1996)
Ponnambalam, S., Reddy, M.: A ga-sa multiobjective hybrid search algorithm for integrating lot sizing and sequencing in flow-line scheduling. The International Journal of Advanced Manufacturing Technology 21(2), 126–137 (2003)
Smith-Daniels, V., Ritzman, L.P.: A model for lot sizing and sequencing in process industries. The International Journal of Production Research 26(4), 647–674 (1988)
Mohammadi, M., Ghomi, S.F., Karimi, B., Torabi, S.A.: Rolling-horizon and fix-and-relax heuristics for the multi-product multi-level capacitated lotsizing problem with sequence-dependent setups. Journal of Intelligent Manufacturing 21(4), 501–510 (2010)
Mohammadi, M., Ghomi, S.F., Karimi, B., Torabi, S.: Mip-based heuristics for lotsizing in capacitated pure flow shop with sequence-dependent setups. International Journal of Production Research 48(10), 2957–2973 (2010)
Mohammadi, M., Torabi, S.A., Ghomi, S.F., Karimi, B.: A new algorithmic approach for capacitated lot-sizing problem in flow shops with sequence-dependent setups. The International Journal of Advanced Manufacturing Technology 49(1-4), 201–211 (2010)
Nawaz, M., Enscore, E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1), 91–95 (1983)
Belo Filho, M.A.F., dos Santos, M.O., de Meneses, C.N.: Dimensionamento e sequenciamento de lotes para uma linha de producao flowshop: Métodos de soluçao (2012)
Ramezanian, R., Saidi-Mehrabad, M., Teimoury, E.: A mathematical model for integrating lot-sizing and scheduling problem in capacitated flow shop environments. The International Journal of Advanced Manufacturing Technology, 1–15 (2012)
Ruiz, R., Stützle, T.: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. European Journal of Operational Research 187(3), 1143–1159 (2008)
Shim, I.S., Kim, H.C., Doh, H.H., Lee, D.H.: A two-stage heuristic for single machine capacitated lot-sizing and scheduling with sequence-dependent setup costs. Computers & Industrial Engineering 61(4), 920–929 (2011)
Simons Jr., J.: Heuristics in flow shop scheduling with sequence dependent setup times. Omega 20(2), 215–225 (1992)
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(3), 1930–1947 (2007)
Ramezanian, R., Saidi-Mehrabad, M.: Hybrid simulated annealing and mip-based heuristics for stochastic lot-sizing and scheduling problem in capacitated multi-stage production system. Applied Mathematical Modelling 37(7), 5134–5147 (2013)
Montgomery, D.G.: Design and Analysis of Experiments. Wiley, New York (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Villadiego, H.M.M., Arroyo, J.E.C., dos Santos, A.G. (2014). An Iterated Greedy Heuristic for Simultaneous Lot-Sizing and Scheduling Problem in Production Flow Shop Environments. In: Blum, C., Ochoa, G. (eds) Evolutionary Computation in Combinatorial Optimisation. EvoCOP 2014. Lecture Notes in Computer Science, vol 8600. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44320-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-662-44320-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44319-4
Online ISBN: 978-3-662-44320-0
eBook Packages: Computer ScienceComputer Science (R0)