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

Open Shop Scheduling to Minimize Finish Time

โœ Scribed by Gonzalez, Teofilo; Sahni, Sartaj

Book ID
121394750
Publisher
Association for Computing Machinery
Year
1976
Tongue
English
Weight
893 KB
Volume
23
Category
Article
ISSN
0004-5411

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Open shop scheduling to minimize the num
Open shop scheduling to minimize the number of late jobs
โœ Christos Koulamas; George J. Kyparisis ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 63 KB ๐Ÿ‘ 2 views

We develop polynomial algorithms for several cases of the NP-hard open shop scheduling problem of minimizing the number of late jobs by utilizing some recent results for the open shop makespan problem. For the two machine common due date problem, we assume that either the machines or the jobs are or

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.