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

Batch scheduling and common due date assignment problem: An NP-hard case

โœ Scribed by Mikhail Y. Kovalyov


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
199 KB
Volume
80
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

โœฆ Synopsis


An important special case of the problem studied in arises when there are equal set-up times and equal job processing times. Computational complexity of this case was indicated to be open, however. I prove its NP-hardness.


๐Ÿ“œ SIMILAR VOLUMES