Lot-sizing on a single imperfect machine: ILP models and FPTAS extensions

Abstract : A single-machine multi-product lot-sizing and sequencing problem is studied. In this problem, items of n different products are manufactured in lots. Demands for products as well as per item processing times are known. There are losses of productivity because of non perfect production. There is also a sequence dependent set-up time between lots of different products. Machine yields and product lead times are assumed to be known deterministic functions. The objective is to minimize the cost of the demand dissatisfaction provided that the total processing time does not exceed a given time limit. We propose two integer linear programming (ILP) models for the NP-hard "fraction defective" case of this problem and compare effectiveness of their ILOG CPLEX realizations with a dynamic programming algorithm in a computer experiment. We also show how an earlier developed fully polynomial time approximation scheme (FPTAS) and one of the ILP models can be extended for a more complex case.
Type de document :
Article dans une revue
Computers and Industrial Engineering, Elsevier, 2013, Volume 65 (Issue 4), pp.Pages 561-569. 〈10.1016/j.cie.2013.04.002〉
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-00881337
Contributeur : Florent Breuil <>
Soumis le : vendredi 8 novembre 2013 - 09:54:13
Dernière modification le : dimanche 28 janvier 2018 - 15:22:05

Identifiants

Citation

Kseniya Schemeleva, Xavier Delorme, Alexandre Dolgui, Frédéric Grimaud, Mikhail Y. Kovalyov. Lot-sizing on a single imperfect machine: ILP models and FPTAS extensions. Computers and Industrial Engineering, Elsevier, 2013, Volume 65 (Issue 4), pp.Pages 561-569. 〈10.1016/j.cie.2013.04.002〉. 〈emse-00881337〉

Partager

Métriques

Consultations de la notice

162