Lot Sizing and Scheduling in Flow Shop with Sequence-Dependent Setups and Backlogging
|
10.5120/3658-4957 |
M.Babaei, M.Mohammadi and S.M.T.FatemiGhomi. Article: Lot Sizing and Scheduling in Flow Shop with Sequence-Dependent Setups and Backlogging. International Journal of Computer Applications 29(8):52-59, September 2011. Full text available. BibTeX
@article{key:article,
author = {M.Babaei and M.Mohammadi and S.M.T.FatemiGhomi},
title = {Article: Lot Sizing and Scheduling in Flow Shop with Sequence-Dependent Setups and Backlogging},
journal = {International Journal of Computer Applications},
year = {2011},
volume = {29},
number = {8},
pages = {52-59},
month = {September},
note = {Full text available}
}
Abstract
Lot sizing and scheduling in flow shop has been considered in this paper. Our study includes a multi-level and multi-period capacitated lot sizing and scheduling problem (CLSP) with sequence-dependent setups, setups carry over in flow shop. In manufacturing environments backlogging is unavoidable. If the production capacity is infinite, any demand can be satisfied on time. But in the real world, production capacity is not infinite so some demand may not be satisfied on time. In this condition backlogging arises naturally. CLSP problems with considering backlogging has been studied fewer by researchers. Also, the sequence-dependent setups and setups carry over are two important events that occur occasionally in factories. In this study an exact mixed integer problem (MIP) in a flow shop CLSP problem with considering sequence-dependent setups, setups carry over and backlogging has been formulated. Our formulation is presented to optimize objective function (including, inventory costs, product costs and setup cost). Since the CLSP problems are extremely NP-hard a lower bound is developed and compared against the optimal solution.
Reference
- Gupta and Magnusson 2005. The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setuptimes. Computers & Operations Research, 32(4), 727–747.
- FabrizioMarinelli, Maria Elena Nenni and Antonio Sforza. Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company.
- Eppen and Martin 1987. Solving multi-item capacitated lot-sizing problems using variable redefinition. Operations.
- Drexl and Kimms 1997. Lot sizing and scheduling, survey and extensions. European Journal of Operational Research, 99(2), 221–235.
- Florian M, Lenstra J, Kan AR (1980). Deterministic production planning: algorithms and complexity. Manage Sci 26:669–679.
- Bitran GR, Yanasse HH (1982). Computational complexity of the capacitated lot size problem.ManageSci 28:1174–1186.
- Trigeiro WW, Thomas LJ, McClain JO (1989). Capacitated lot sizing with setup times. Manage Sci 35:353–366.
- Garey M, Johnson D (1979). Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York.
- Yuyue Song a, Gin Hor Chan. Single item lot-sizing problems with backlogging on a single machine at a finite production rate.
- P.L. Abad. Optimal lot size for a perishable good under conditions of finite production and partial backordering and lost sale.
- Daniel Quadt, Heinrich Kuhn. Capacitated lot-Sizing and scheduling with parallel machines, back-orders, and setup carry-over.
- Yves Pochet and Laurence A. Wolsey. Lot size models with back-logging: Strong reformulations and cutting planes,Math Programming 40 (1988), 317–335.
- Harvey H. Millara and MinzhuYangb. Lagrangian heuristics for the capac- itated multi-item lot-sizing problem with backordering, Int J Prod Economics 34 (1994), 1–15.
- Ping-FengPaiE-mail. Solving the capacitated lot-sizing problem with backorder consideration, J Oper Res Soc 52 (2001), 952–959.
- Karimi,Ghomi, S M T Fatemi1 and Wilson J M. A tabu search heuristic for solving the CLSP with backlogging and set-up carry-over, J Oper Res Soc 57 (2006), 140–147.
- Nabil Absi, SafiaKedad-Sidhoum. The multi-item capacitated lot-sizing problem with setup times and shortage costs, Eur J Oper Res 185 (2008), 1351–1374.
- Bernardo Almada-loboab; Diego Klabjanb; Maria Antóniacarravillaac; José F. Oliveiraac. Single machine multi-product capacitated lot sizing with sequence-dependent setups.
- C. Oztürk, A.M. Ornek. Capacitated lot sizing with linked lots for general product structures in job shops.
- Florian Sahlinga, LisbethBuschkühl, Horst Tempelmeierb and Stefan Helber. Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
- Ik-Soo Shim, Hyeok-Chol Kim, Hyoung-Ho Doh and Dong-Ho Lee. A two-stage heuristic for single machine capacitated lot-sizing and scheduling with sequence-dependent setup costs.
- Merece, C. Fonton, G, 2003. MIP-based heuristics for capacitated lotsizing problems. International Journal of Production Economics 85.
- Gu¨ nterFandel, CathrinStammen-Hegene. Simultaneous lot sizing and scheduling for multi-product multi-level production 140/AUZ II, 58084 Hagen, Germany.
- Knut Haase. The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times.