|
DRUM >
Institute for Systems Research >
Institute for Systems Research Technical Reports >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1903/5554
|
| Title: | On Parallel-Machine Scheduling with Operator-Constrained Setups |
| Authors: | Herrmann, Jeffrey W.
Lee, Chung-Yee |
| Department/Program: | ISR |
| Type: | Technical Report |
| Keywords: | algorithms, combinatorics, computational complexity, scheduling , sequencing, Systems Integration Methodology |
| Issue Date: | 1994 |
| Series/Report no.: | ISR; TR 1994-85 |
| Abstract: | The 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. |
| URI: | http://hdl.handle.net/1903/5554 |
| Appears in Collections: | Institute for Systems Research Technical Reports
|
All items in DRUM are protected by copyright, with all rights reserved.
|
