Loading...
Please wait, while we are loading the content...
Similar Documents
Makespan minimization in job shops: a linear time approximation schemes (1999).
| Content Provider | CiteSeerX |
|---|---|
| Author | Jansen, Klaus Solis-Oba, Roberto Sviridenko, Maxim |
| Abstract | In this paper we present a linear time approximation scheme for the job shop scheduling problem with fixed number of machines and fixed number of operations per job. Our approximation scheme can be extended to the case of job shop problems with release and delivery times, flexible job shops, dag job shops and preemptive variants of these problems. |
| File Format | |
| Publisher Date | 1999-01-01 |
| Access Restriction | Open |
| Subject Keyword | Linear Time Approximation Scheme Job Shop Makespan Minimization Fixed Number Approximation Scheme Job Shop Problem Preemptive Variant Delivery Time Dag Job Shop Flexible Job Shop |
| Content Type | Text |
| Resource Type | Article |