Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
 
<< 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 13 van 18 gevonden artikelen
 
 
  The capacitated lot sizing problem with overtime decisions and setup times
 
 
Titel: The capacitated lot sizing problem with overtime decisions and setup times
Auteur: Ozdamar, Linet
Bozyel, Mehmet Ali
Verschenen in: IIE transactions
Paginering: Jaargang 32 (2000) nr. 11 pagina's 1043-1057
Jaar: 2000-11-01
Inhoud: The Capacitated Lot Sizing-Problem (CLSP) consists of planning the lot sizes of multiple items over a planning horizon with the objective of minimizing setup and inventory holding costs. In each period that an item is produced a setup cost is incurred. Capacity is limited and homogeneous. Here, the CLSP is extended to include overtime decisions and capacity consuming setups. The objective function consists of minimizing inventory holding and overtime costs. Setups incur costs implicitly via overtime costs, that is, they lead to additional overtime costs when setup times contribute to the use of overtime capacity in a certain period. The resulting problem becomes more complicated than the standard CLSP and requires methods different from the ones proposed for the latter. Consequently, new heuristic approaches are developed to deal with this problem. Among the heuristic approaches are the classical HPP approach and its modifications, an iterative approach omitting binary variables in the model, a Genetic Algorithm approach based on the transportation-like formulation of the single item production planning model with dynamic demand and a Simulated Annealing approach based on shifting family lot sizes among consecutive periods. Computational results demonstrate that the Simulated Annealing approach produces high quality schedules and is computationally most efficient.
Uitgever: Taylor & Francis
Bronbestand: Elektronische Wetenschappelijke Tijdschriften
 
 

                             Details van artikel 13 van 18 gevonden artikelen
 
<< vorige    volgende >>
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland