Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities

Haase, Knut; Kimms, Alf

doi:10.1016/s0925-5273(99)00119-x

Cited by 119 publications

(77 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Based on Table 5, we also conclude that the most significant portion of the gap comes from the heuristic (and not from 17 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 To the best of our knowledge, Gupta and Magnusson [2005] is the only paper in the literature to publish results (gaps between lower and upper bounds) for this problem. However, since inventories and production quantities are expressed in units of capacity (normalized to one), they adapted the parameters of the instance generator used by Haase and Kimms [2000]. By comparing our parameters with the parameters of their generator, their instances are similar to the case with θ = 50.…”

Section: Computational Resultsmentioning

confidence: 99%

“…They assume that exactly a given number of setups occur in a time period between any two given products, independently of their demand patterns. Haase and Kimms [2000] propose a model for CLSP with sequence dependent setup times and costs in which the efficient product sequences are pre-determined. Therefore, it is to decide which sequences will be 3 used in each period.…”

Section: Literature Reviewmentioning

confidence: 99%

“…In order to computationally evaluate the models, we generated random instances based on the parameters used by Haase and Kimms [2000]. The machine is always set up for product 1 at the beginning of the planning horizon.…”

Section: Benchmarking the First Formulationmentioning

confidence: 99%

See 2 more Smart Citations

Single machine multi-product capacitated lot sizing with sequence-dependent setups

Almada-Lobo¹,

Klabjan²,

Carravilla³

et al. 2007

International Journal of Production Research

103

View full text Add to dashboard Cite

Section: Computational Resultsmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Single machine multi-product capacitated lot sizing with sequence-dependent setups

Almada-Lobo¹,

Klabjan²,

Carravilla³

et al. 2007

International Journal of Production Research

103

View full text Add to dashboard Cite

“…Frequent rescheduling (Haase and Kimms;1999) implies that firm schedules should really only be specified for the immediate to short term over which demand forecasts will not change (much), while approximate or aggregate planning (rather than scheduling should be carried out for medium to long term. This poses interesting (and not trivial) research challenges about how to perform planning that result in effective and efficient short term schedules (Clark;2003).…”

Section: Computational Testsmentioning

confidence: 99%

Production lot sizing and scheduling with non-triangular sequence-dependent setup times

Clark

Mahdieh

Rangel

2014

International Journal of Production Research

View full text Add to dashboard Cite

This article considers a production lot sizing and scheduling problem with sequencedependent setup times that are not triangular. Consider, for example, a product p that contaminates some other product r unless either a decontamination occurs as part of a substantial setup time st pr or there is a third product q that can absorb p's contamination. When setup times are triangular then st pr ≤ st pq + st qr and there is always an optimal lot sequence with at most one lot (AM1L) per product per period. However, product q's ability to absorb p's contamination presents a shortcut opportunity and could result in shorter non-triangular setup times such that st pr > st pq + st qr . This implies that it can sometimes be optimal for a shortcut product such as q to be produced in more than one lot within the same period, breaking the AM1L assumption in much research. This article formulates and explains a new optimal model that not only permits multiple lots (ML) per product per period, but also prohibits subtours using a polynomial number of constraints rather than an exponential number. Computational tests demonstrate the effectiveness of the ML model, even in the presence of just one decontaminating shortcut product, and its fast speed of solution compared to the equivalent AM1L model.

show abstract

“…Extensive computational tests prove the model's superiority with respect to previously existing models. Haase and Kimms (2000) take a different approach, considering a CLSP-like model that handles sequence dependent setup times and costs, but by pre-defining efficient production sequences, sub-optimal solutions may be found. The authors also assume no inventory may exist at the beginning of the period in which a production lot of that same product is to be produced.…”

Section: Literature Reviewmentioning

confidence: 99%

Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups

Menezes

Clark

Almada-Lobo

2010

J Sched

View full text Add to dashboard Cite

We recommend you cite the published version. The publisher's URL is: http://dx.doi.org/10.1007/s10951-010-0197-6 Refereed: YesThe original publication is available at www.springerlink.com Disclaimer UWE has obtained warranties from all depositors as to their title in the material deposited and as to their right to deposit such material. UWE makes no representation or warranties of commercial utility, title, or fitness for a particular purpose or any other warranty, express or implied in respect of any material deposited.UWE makes no representation that the use of the materials will not infringe any patent, copyright, trademark or other property or proprietary rights. UWE accepts no liability for any infringement of intellectual property rights in any material deposited but will remove such material from public view pending investigation in the event of an allegation of any such infringement. AbstractIn production planning, sequence dependent setup times and costs are often incurred for switchovers from one product to another. When setup times and costs do not respect the triangular inequality, a situation may occur where the optimal solution includes more than one batch of the same product in a single period -in other words, at least one sub tour exists in the production sequence of that period. By allowing setup crossovers, flexibility is increased and better solutions can be found. In tight capacity conditions, or whenever setup times are significant, setup crossovers are needed to assure feasibility. We present the first linear mixed integer programming extension for the capacitated lotsizing and scheduling problem incorporating all the necessary features of sequence sub tours and setup crossovers. This formulation is more efficient than other well known lotsizing and scheduling models.

show abstract

Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities

Cited by 119 publications

References 23 publications

Single machine multi-product capacitated lot sizing with sequence-dependent setups

Single machine multi-product capacitated lot sizing with sequence-dependent setups

Production lot sizing and scheduling with non-triangular sequence-dependent setup times

Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups

Contact Info

Product

Resources

About