๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness

โœ Scribed by Yuan, J. J.; Ng, C. T.; Cheng, T. C. E.

Book ID
121596424
Publisher
Springer US
Year
2013
Tongue
English
Weight
215 KB
Volume
18
Category
Article
ISSN
1094-6136

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Note: Open-shop scheduling with release
Note: Open-shop scheduling with release dates to minimize maximum lateness
โœ Hans Kellerer; Thomas Tautenhahn; Gerhard Woeginger ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 295 KB ๐Ÿ‘ 2 views

We present the first polynomial-time algorithm for an open-shop problem with unit execution times, arbitrary release dates, and due dates. The objective is to minimize maximum lateness. 0 I995 John Wiley & Sons. Inc.