Lot-Sizing and Sequencing on a Single Imperfect Machine

Alexandre Dolgui 1 Mikhail Y. Kovalyov 2 Ksenia Shchamialiova 3
1 Laboratoire en Sciences et Technologies de l'Information
MSGI-ENSMSE - Département Méthodes Scientifiques pour la Gestion Industrielle, ROGI-ENSMSE - Equipe : Recherche Opérationnelle pour le Génie Industriel
Abstract : We study a problem of lot-sizing and sequencing several discrete products on a single machine. A sequence dependent setup time is required between the lots of different products. The machine is imperfect in the sense that it can produce defective items, and furthermore breakdown. The number of the defective items for each product is given as an integer valued non-decreasing function of the manufactured quantity for this product. The total machine breakdown time is given as a real valued non-decreasing function of the manufactured quantities of all the products. The objective is to minimize the total cost of the demand dissatisfaction, provided that a given upper bound on the completion time for the last item has been satisfied.
Document type :
Book sections
Liste complète des métadonnées

Contributor : Florent Breuil <>
Submitted on : Wednesday, March 14, 2012 - 4:38:32 PM
Last modification on : Saturday, March 30, 2019 - 5:36:02 PM



Alexandre Dolgui, Mikhail Y. Kovalyov, Ksenia Shchamialiova. Lot-Sizing and Sequencing on a Single Imperfect Machine. Le Thi, Hoai: Bouvry, Pascal: Pham Dinh, Tao. Modelling, Computation and Optimization in Information Systems and Management Sciences, Springer Berlin Heidelberg, p 117 - 125, 2008, ⟨10.1007/978-3-540-87477-5_13⟩. ⟨emse-00679088⟩



Record views