International audienceA problem of lot-sizing and sequencing several products on a single machine is studied. The machine is imperfect in two senses: it can produce defective items and it can breakdown. The number of defective items for each product is given as an integer valued non-decreasing function of the manufactured quantity. The total machine breakdown time is given as a real valued non-decreasing function of the manufactured quantities of all the products. A sequence-dependent setup time is required to switch the machine from manufacturing one product to another. Two problem settings are considered. In the first, the objective is to minimize the completion time of the last item, provided that all the product demands for the good quality items are satisfied. In the second, the goal is to minimize the total cost of demand dissatisfaction, subject to an assumption that the completion time of the last item does not exceed a given upper bound. Computational complexity and algorithmic results are presented, including an FPTAS for a special case of the cost minimization problem, and computer experiments with the FPTAS

International audienceWe 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