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

Stochastic scheduling to minimize expected maximum lateness

โœ Scribed by Xianyi Wu; Xian Zhou


Book ID
108118416
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
198 KB
Volume
190
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Note: Open-shop scheduling with release
โœ 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.