Show simple item record

dc.contributor.authorHerrmann, Jeffrey W.en_US
dc.contributor.authorLee, Chung-Yeeen_US
dc.date.accessioned2007-05-23T09:57:21Z
dc.date.available2007-05-23T09:57:21Z
dc.date.issued1994en_US
dc.identifier.urihttp://hdl.handle.net/1903/5554
dc.description.abstractThe processing of a task on a machine often requires an operator to setup the job. In this paper we consider the problem of scheduling a finite set of jobs on a number of identical parallel machines. Each job has a setup that must be performed by an operator, who can perform only one setup at a time. We examine the problems of minimizing the schedule makespan. Out results include complexity proofs, special cases that can be solved in polynomial time, lower bounds, and approximation algorithms with error bounds.en_US
dc.format.extent743489 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1994-85en_US
dc.subjectalgorithmsen_US
dc.subjectcombinatoricsen_US
dc.subjectcomputational complexityen_US
dc.subjectscheduling en_US
dc.subjectsequencingen_US
dc.subjectSystems Integration Methodologyen_US
dc.titleOn Parallel-Machine Scheduling with Operator-Constrained Setupsen_US
dc.typeTechnical Reporten_US
dc.contributor.departmentISRen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record