𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The complexity of mean flow time scheduling problems with release times

✍ Scribed by Philippe Baptiste; Peter Brucker; Marek Chrobak; Christoph Dürr; Svetlana A. Kravchenko; Francis Sourd

Publisher
Springer US
Year
2007
Tongue
English
Weight
396 KB
Volume
10
Category
Article
ISSN
1094-6136

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of scheduling starting ti
The complexity of scheduling starting time dependent tasks with release times
✍ T.C.E. Cheng; Q. Ding 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 484 KB

We consider a family of problems of scheduling a set of starting time dependent tasks with release times and linearly increasing/decreasing processing rates on a single machine to minimize the makespan. We first present an equivalence relationship between several pairs of problems. Based on this rel

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.