A polynomial-time approximation scheme f
β
Gerhard J. Woeginger
π
Article
π
1998
π
Springer US
π
English
β 100 KB
π 3 views
We investigate the single-machine sequencing problem in which each job has a processing time and a delivery time. The jobs are divided into families and a set-up time is incurred whenever there is a switch from a job in one family to a job in another family. This set-up only depends on the family of