Show simple item record

dc.contributor.authorErel, E.en_US
dc.contributor.authorGhosh, J. B.en_US
dc.date.accessioned2016-02-08T10:15:24Z
dc.date.available2016-02-08T10:15:24Z
dc.date.issued2007en_US
dc.identifier.issn0096-3003
dc.identifier.urihttp://hdl.handle.net/11693/23541
dc.description.abstractWe consider a situation where C customers each order various quantities (possibly zero in some cases) of products from P different families, which can be produced on a continuously available machine in any sequence (requiring a setup whenever production switches from one family to another). We assume that the time needed for a setup depends only on the family to be produced immediately after it, and we follow the item availability model (which implies that all units are ready for dispatch as soon as they are produced). However, an order is shipped only when all units required by a customer are ready. The time from the start (time zero) to the completion of a customer order is called the order lead time. The problem, which restates the original description of the customer order scheduling problem, entails finding a production schedule that will minimize the total order lead time. While this problem has received some attention in the literature, its complexity status has remained vexingly open. In this note, we show for the first time that the problem is strongly NP-hard. We proceed to give dynamic programming based exact solution algorithms for the general problem and a special case (where C is fixed). These algorithms allow us to solve small instances of the problem and understand the problem complexity more fully. In particular, the solution of the special case shows that the problem is solvable in polynomial time when C is fixed.en_US
dc.language.isoEnglishen_US
dc.source.titleApplied Mathematics and Computationen_US
dc.relation.isversionofhttps://doi.org/10.1016/j.amc.2006.06.086en_US
dc.subjectComputational complexityen_US
dc.subjectDynamic programmingen_US
dc.subjectMachine schedulingen_US
dc.subjectAlgorithmsen_US
dc.subjectCustomer satisfactionen_US
dc.subjectMachineryen_US
dc.subjectMathematical modelsen_US
dc.subjectPolynomialsen_US
dc.subjectCustomer order schedulingen_US
dc.subjectScheduling problemsen_US
dc.subjectSchedulingen_US
dc.titleCustomer order scheduling on a single machine with family setup times: complexity and algorithmsen_US
dc.typeArticleen_US
dc.departmentDepartment of Managementen_US
dc.departmentDepartment of Fine Artsen_US
dc.citation.spage11en_US
dc.citation.epage18en_US
dc.citation.volumeNumber185en_US
dc.identifier.doi10.1016/j.amc.2006.06.086en_US
dc.publisherElsevieren_US
dc.identifier.eissn1873-5649


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record