𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times

✍ Scribed by Stanisłlaw Zdrzałka

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
616 KB
Volume
51
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polynomial-time approximation scheme f
A polynomial-time approximation scheme for single-machine sequencing with delivery times and sequence-independent batch set-up times
✍ 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

Lower bounds and algorithms for flowtime
Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
✍ Simon Dunstall; Andrew Wirth; Kenneth Baker 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 165 KB 👁 3 views

We consider the scheduling of N jobs divided into G families for processing on a single machine. No set-up is necessary between jobs belonging to the same family. A set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i = j, the duration of this