✦ LIBER ✦

Scheduling linearly shortening jobs under precedence constraints

✍ Scribed by Stanisław Gawiejnowicz; Tsung-Chyan Lai; Ming-Huang Chiang

Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 232 KB
Volume: 35
Category: Article
ISSN: 0307-904X
DOI: 10.1016/j.apm.2010.11.012

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

118 Scheduling jobs with precedence cons

118 Scheduling jobs with precedence constraints on jobshops and shops' coordination: Sun Xiaoqing, Zheng Yingping, pp 169–173

📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 124 KB

In this paper, hybrid states are introduced to study DEDS. On the basis of the description of the hybrid states and under certain assumptions, the system becomes a timehomogeneous hybrid-state Markovian process. The semigroup theory is used to study the process. A partial differential equation is ob