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

Open shop problems with unit time operations

โœ Scribed by Peter Brucker; Bernd Jurisch; Marion Jurisch


Book ID
105187129
Publisher
Springer
Year
1993
Tongue
English
Weight
695 KB
Volume
37
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Open shop problem with zero-one time ope
โœ Marek Kubale ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 744 KB

We study the problem of constructing a minimum makespan schedule for the n-job m-machine open shop with zero-one time operations and integer release dates and deadlines. The general scheduling problem is shown to be NP-complete. Two polynomial-time algorithms are given for the following special case