✦ LIBER ✦

Pre-Emptive Scheduling Problems with Controllable Processing Times

✍ Scribed by Natalia V. Shakhlevich; Vitaly A. Strusevich

Book ID: 106429473
Publisher: Springer US
Year: 2005
Tongue: English
Weight: 188 KB
Volume: 8
Category: Article
ISSN: 1094-6136
DOI: 10.1007/s10951-005-6813-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A FRAMEWORK FOR MACHINE SCHEDULING PROBL

A FRAMEWORK FOR MACHINE SCHEDULING PROBLEMS WITH CONTROLLABLE PROCESSING TIMES

✍ Bahram Alidaee; Gary A. Kochenberger 📂 Article 📅 2009 🏛 Production and Operations Management Society 🌐 English ⚖ 303 KB

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.

Network flow approaches to pre-emptive o

Network flow approaches to pre-emptive open-shop scheduling problems with time-windows

✍ A. Sedeño-Noda; D. Alcaide; C. González-Martín 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 248 KB

A new bounding mechanism for the CNC mac

A new bounding mechanism for the CNC machine scheduling problems with controllable processing times

✍ Rabia K. Kayan; M. Selim Akturk 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 404 KB

Single machine common flow allowance sch

Single machine common flow allowance scheduling with controllable processing times

✍ Ji-Bo Wang 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 181 KB

Single-machine scheduling with controlla

Single-machine scheduling with controllable processing times and learning effect

✍ Na Yin; Xiao-Yuan Wang 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 265 KB