✦ LIBER ✦

Single machine scheduling with controllable processing times: a parametric study

✍ Scribed by In-Soo Lee

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 360 KB
Volume: 22
Category: Article
ISSN: 0925-5273
DOI: 10.1016/0925-5273(91)90002-b

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An approximation algorithm for a single-

An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times

✍ Eugeniusz Nowicki 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 455 KB

A single-machine scheduling problem with

A single-machine scheduling problem with random processing times

✍ S. Chakravarthy 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 282 KB

A two-machine flow shop scheduling probl

A two-machine flow shop scheduling problem with controllable job processing times

✍ Eugeniusz Nowicki; Stanisław Zdrzałka 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 639 KB

Scheduling jobs on a single machine with

Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: worst-case analysis

✍ Stanisław Zdrzałka 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 294 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.

Single-machine scheduling with deteriora

Single-machine scheduling with deteriorating functions for job processing times

✍ T.C.E. Cheng; Wen-Chiung Lee; Chin-Chia Wu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 194 KB