Show simple item record

dc.contributor.authorTaner, M. R.en_US
dc.contributor.authorHodgson, T. J.en_US
dc.contributor.authorKing, R. E.en_US
dc.contributor.authorSchultz, S. R.en_US
dc.date.accessioned2015-07-28T11:57:59Z
dc.date.available2015-07-28T11:57:59Z
dc.date.issued2007-12-22en_US
dc.identifier.issn0360-8352
dc.identifier.urihttp://hdl.handle.net/11693/11526
dc.description.abstractThis paper addresses a static, n-job, single-machine scheduling problem with sequence dependent family setups. The setup matrix follows a special structure where a constant setup is required only if a job from a smaller indexed family is an immediate successor of one from a larger indexed family. The objective is to minimize the maximum lateness (Lmax). A two-step neighborhood search procedure and an implicit enumeration scheme are proposed. Both procedures exploit the problem structure. The enumeration scheme produces optimum solutions to small and medium sized problems in reasonable computational times, yet it fails to perform efficiently in larger instances. Computational results show that the heuristic procedure is highly effective, and is efficient even for extremely large problems.en_US
dc.language.isoEnglishen_US
dc.source.titleComputers and Industrial Engineeringen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.cie.2006.10.008en_US
dc.subjectSchedulingen_US
dc.subjectMaximum Latenessen_US
dc.subjectSequence Dependent Family Setupsen_US
dc.subjectComedownen_US
dc.subjectHeuristicsen_US
dc.titleSatisfying due-dates in the presence of sequence dependent family setups with a special comedown structureen_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.citation.spage57en_US
dc.citation.epage70en_US
dc.citation.volumeNumber52en_US
dc.citation.issueNumber1en_US
dc.identifier.doi10.1016/j.cie.2006.10.008en_US
dc.publisherElsevieren_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record