Show simple item record

dc.contributor.authorErel, E.en_US
dc.contributor.authorGhosh, J. B.en_US
dc.date.accessioned2016-02-08T10:12:44Z
dc.date.available2016-02-08T10:12:44Z
dc.date.issued2007en_US
dc.identifier.issn0360-8352
dc.identifier.urihttp://hdl.handle.net/11693/23356
dc.description.abstractIn this paper, we address a single-machine scheduling problem with due dates and batch setup times to minimize the weighted number of tardy jobs. We give a pseudo-polynomial dynamic program and a fully-polynomial approximation scheme for the case where the due dates are uniform within a family.en_US
dc.language.isoEnglishen_US
dc.source.titleComputers and Industrial Engineeringen_US
dc.relation.isversionofhttps://doi.org/10.1016/j.cie.2007.03.006en_US
dc.subjectApproximationen_US
dc.subjectDynamic programmingen_US
dc.subjectIndustrial engineeringen_US
dc.subjectOptimizationen_US
dc.subjectPolynomial approximationen_US
dc.subjectProblem solvingen_US
dc.subjectSchedulingen_US
dc.subjectBatch schedulingen_US
dc.subjectBatch setup timesen_US
dc.subjectTardy jobsen_US
dc.subjectJob analysisen_US
dc.titleBatch scheduling to minimize the weighted number of tardy jobsen_US
dc.typeArticleen_US
dc.departmentDepartment of Fine Artsen_US
dc.departmentDepartment of Managementen_US
dc.citation.spage394en_US
dc.citation.epage400en_US
dc.citation.volumeNumber53en_US
dc.identifier.doi10.1016/j.cie.2007.03.006en_US
dc.publisherPergamon Pressen_US
dc.identifier.eissn1879-0550


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record