|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 2 van 9 gevonden artikelen
| Titel: |
An industrial extension of the discrete lot-sizing and scheduling problem |
| Auteur: |
Jans, Raf Degraeve, Zeger |
| Verschenen in: |
IIE transactions |
| Paginering: | Jaargang 36 (2004) nr. 1 pagina's 47-58 |
| Jaar: |
2004-01 |
| Inhoud: |
We propose a model and solution algorithm for an industrial production planning problem at Solideal, an international tire manufacturer. The tires are built in molds and are produced in heaters in large series production runs. Some tires can be cured in two different types of heaters with different efficiencies. Preparing a heater and mold for a specific tire type requires a start up. The resulting lot-sizing problem is an extension of the standard Discrete Lot-Sizing and Scheduling Problem. The specific extensions which complicate the problem are: (i) general start-up times, which can be a fraction of the time bucket; (ii) multiple alternative machines with different efficiencies; (iii) multiple capacitated resources, namely the molds and heaters; and (iv) backlogging. These issues are directly motivated by our real life production planning problem. We propose a column-generation-based algorithm for this problem. The dynamic programming recursion for the subproblem is substantially improved by using valid bounds on the state space and cost function. Further, Lagrange relaxation is used to reduce the degeneracy of the master problem. We test our algorithm on real life data sets with up to 30 products and 30 periods and find good quality solutions and lower bounds within a reasonable computation time. Our best implementation has an overall average gap of 0.25% on these test problems. |
| Uitgever: |
Taylor & Francis |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 2 van 9 gevonden artikelen
| << vorige | volgende >> |