Skip to Main content Skip to Navigation
Reports

Just-in-time changeover cost minimization problem : Dynamic programming approach and complexity results

Lyès Benyoucef 1 Bernard Penz
1 MACSI - Industrial system modeling, analysis and operation
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : The problem studied in this paper originates from a just-in-time environment where a new supplying mode, called Synchronous Delivery, has been introduced recently. We consider a multi-product single machine scheduling problem in which the total changeover costs has to be minimized. The products are of different types and a changeover cost is incurred whenever switching from one product type to another. For each product, the processing time is equal to one and its deadline is different from deadlines of all other products. We present five complexity results and propose dynamic programming and heuristic approaches to the problem. Computational results are given comparing two heuristics to the optimal solution given by the dynamic programming method.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00071859
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 6:59:10 PM
Last modification on : Friday, February 26, 2021 - 3:28:04 PM
Long-term archiving on: : Sunday, April 4, 2010 - 10:41:29 PM

Identifiers

  • HAL Id : inria-00071859, version 1

Collections

Citation

Lyès Benyoucef, Bernard Penz. Just-in-time changeover cost minimization problem : Dynamic programming approach and complexity results. [Research Report] RR-4727, INRIA. 2003, pp.27. ⟨inria-00071859⟩

Share

Metrics

Record views

154

Files downloads

529