✦ LIBER ✦

Analysis of approximation algorithms for single-machine scheduling with delivery times and sequence independent batch setup times

✍ Scribed by Stanisław Zdrzałka

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 695 KB
Volume: 80
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(93)e0160-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation algorithms for single-mach

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

✍ Stanisłlaw Zdrzałka 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 616 KB

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

An approximation algorithm for a single-

An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times

✍ Eugeniusz Nowicki 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 455 KB