This paper deals with the problem of preemptive scheduling in a two-stage flowshop with parallel unrelated machines and renewable resources at both the stages. The resource requirements are of a 0-1 type. The objective is the minimization of makespan. The problem is NP-hard. Four heuristic algorithm
✦ LIBER ✦
Scheduling unit-time tasks in renewable resource constrained flowshops
✍ Scribed by H. Süral; S. Kondakci; N. Erkip
- Publisher
- Springer
- Year
- 1992
- Tongue
- English
- Weight
- 863 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0340-9422
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Heuristic algorithms for preemptive sche
✍
Ewa Figielska
📂
Article
📅
2010
🏛
Elsevier Science
🌐
English
⚖ 464 KB
New Algorithms for Resource Reclaiming f
✍
G. Manimaran; C. Siva Ram Murthy; Machiraju Vijay; Krithi Ramamritham
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 208 KB
The scheduling of tasks in multiprocessor real-time systems has attracted many researchers in the recent past. Tasks in these systems have deadlines to be met, and most of the realtime scheduling algorithms use worst case computation times to schedule these tasks. Many resources will be left unused
A novel fault-tolerant scheduling algori
✍
Xiao Qin; Hong Jiang
📂
Article
📅
2006
🏛
Elsevier Science
🌐
English
⚖ 364 KB