Lot-Sizing and Sequencing on a Single Imperfect Machine

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.
Type de document :
Chapitre d'ouvrage
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〉
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-00679088
Contributeur : Florent Breuil <>
Soumis le : mercredi 14 mars 2012 - 16:38:32
Dernière modification le : jeudi 30 novembre 2017 - 01:19:25

Identifiants

Citation

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〉

Partager

Métriques

Consultations de la notice

90