✦ LIBER ✦

Single-machine scheduling with precedence constraints and decreasing start-time dependent processing times

✍ Scribed by Wen-Jun Gao; Xue Huang; Ji-Bo Wang

Publisher: Springer
Year: 2009
Tongue: English
Weight: 266 KB
Volume: 46
Category: Article
ISSN: 0268-3768
DOI: 10.1007/s00170-009-2089-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Single-machine group scheduling with lin

Single-machine group scheduling with linearly decreasing time-dependent setup times and job processing times

✍ Ji-Bo Wang; Linyan Sun 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 264 KB

A note on single-machine scheduling with

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

✍ Ji-Bo Wang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 175 KB

Single machine scheduling with decreasin

Single machine scheduling with decreasing linear deterioration under precedence constraints

✍ Ji-Bo Wang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 538 KB

This paper deals with single-machine scheduling problems with decreasing linear deterioration, i.e., jobs whose processing times are a decreasing function of their starting times. In addition, the jobs are related by parallel chains and a series-parallel graph precedence constraints, respectively. I

Time complexity of single machine schedu

Time complexity of single machine scheduling with stochastic precedence constraints

✍ M. Bücker 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 776 KB

Parallel machine scheduling with time de

Parallel machine scheduling with time dependent processing times

✍ Zhi-Long Chen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 598 KB