✦ LIBER ✦

A note on single-machine scheduling with decreasing time-dependent job processing times

✍ Scribed by Ji-Bo Wang

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 175 KB
Volume: 34
Category: Article
ISSN: 0307-904X
DOI: 10.1016/j.apm.2009.04.018

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Scheduling jobs with piecewise linear de

Scheduling jobs with piecewise linear decreasing processing times

✍ T.C. Edwin Cheng; Qing Ding; Mikhail Y. Kovalyov; Aleksander Bachman; Adam Jania 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 173 KB

Single machine scheduling with start tim

Single machine scheduling with start time dependent processing times: Some solvable cases

✍ P.S. Sundararaghavan; A.S. Kunnathur 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 554 KB

A note on single-processor scheduling wi

A note on single-processor scheduling with time-dependent execution times

✍ Zhi-Long Chen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 169 KB

Single machine scheduling with past-sequ

Single machine scheduling with past-sequence-dependent setup times and deteriorating jobs

✍ Chuanli Zhao; Hengyong Tang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 180 KB

This paper considers single machine scheduling problems with setup times and deteriorating jobs. The setup times are proportional to the length of the already processed jobs, that is, the setup times are past-sequence-dependent (p-s-d). It is assumed that the job processing times are defined by func

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