𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A decomposition approach to job-shop scheduling problem with discretely controllable processing times

✍ Scribed by GangGang Niu; ShuDong Sun; Pascal Lafon; HongAn Yang

Book ID
107356892
Publisher
SP Science China Press
Year
2011
Tongue
English
Weight
602 KB
Volume
54
Category
Article
ISSN
1006-9321

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Complexity of a scheduling problem with
Complexity of a scheduling problem with controllable processing times
✍ Byung-Cheon Choi; Joseph Y.-T. Leung; Michael L. Pinedo πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 766 KB

We consider the problem of scheduling a set of independent jobs on a single machine so as to minimize the total weighted completion time, subject to the constraint that the total compression cost is less than or equal to a fixed amount. The complexity of this problem is mentioned as an open problem.