Models and solving procedures for continuous-time production planning - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IIE Transactions Année : 2000

Models and solving procedures for continuous-time production planning

Résumé

The goal of this paper is to solve a continuous time production planning problem, where production rates are supposed to be piecewise constant. The problem is then to determine not only the rates, but also the times, called switching times, at which these rates may change. An iterative procedure is proposed where, at the first step, optimal rates are determined given the switching times and, at the second step, new switching times are added given the rates. Various models are proposed and discussed for the first step, and a linear programming formulation is finally retained. A special effort has been made to reduce the size of the linear programming problem solved at each iteration of the procedure. Several rules to remove or add switching times are also analyzed. Computational experiments are presented comparing two versions of the procedure and showing its efficiency.
Fichier non déposé

Dates et versions

hal-00069417 , version 1 (17-05-2006)

Identifiants

Citer

Stéphane Dauzère-Pérès, Stanley B. Gershwin, Marc Sevaux. Models and solving procedures for continuous-time production planning. IIE Transactions, 2000, 32 (2), pp.93-103. ⟨10.1023/A:1007648012154⟩. ⟨hal-00069417⟩
95 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More