Show simple item record

dc.contributor.authorGhosh, J. B.en_US
dc.contributor.authorGupta, J. N. D.en_US
dc.date.accessioned2015-07-28T11:56:46Z
dc.date.available2015-07-28T11:56:46Z
dc.date.issued1997en_US
dc.identifier.issn0167-6377
dc.identifier.urihttp://hdl.handle.net/11693/11068
dc.description.abstractWe address the single-machine batch scheduling problem which arises when there are job families and setup requirements exist between these families; our objective is to minimize the maximum lateness. As our main result, we give an improved dynamic program for the solution of the problem.en_US
dc.language.isoEnglishen_US
dc.source.titleOperations Research Lettersen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/S0167-6377(97)00028-Xen_US
dc.subjectAnalysis of algorithmsen_US
dc.subjectDynamic programmingen_US
dc.subjectProductionen_US
dc.subjectSchedulingen_US
dc.titleBatch scheduling to minimize maximum latenessen_US
dc.typeArticleen_US
dc.departmentDepartment of Managementen_US
dc.citation.spage77en_US
dc.citation.epage80en_US
dc.citation.volumeNumber21en_US
dc.citation.issueNumber2en_US
dc.identifier.doi10.1016/S0167-6377(97)00028-Xen_US
dc.publisherElsevieren_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record