𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Time complexity of single machine scheduling with stochastic precedence constraints

✍ Scribed by M. Bücker

Publisher
Springer
Year
1992
Tongue
English
Weight
776 KB
Volume
36
Category
Article
ISSN
0340-9422

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

Single machine scheduling problems with
Single machine scheduling problems with financial resource constraints: Some complexity results and properties
✍ Evgeny R. Gafarov; Alexander A. Lazarev; Frank Werner 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 259 KB

We consider single machine scheduling problems with a non-renewable resource. These types of problems have not been intensively investigated in the literature so far. For several problems of these types with standard objective functions (namely the minimization of makespan, total tardiness, number o

Fixed priority scheduling of tasks with
Fixed priority scheduling of tasks with arbitrary precedence constraints in distributed hard real-time systems
✍ Romulo Silva de Oliveira; Joni da Silva Fraga 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 219 KB

This paper considers the schedulability analysis of real-time distributed applications where tasks may present arbitrary precedence relations. It is assumed that tasks are periodic or sporadic and dynamically released. They have ®xed priorities and hard end-to-end deadlines that are equal to or less