𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimizing the overhead for some tree-scheduling problems

✍ Scribed by Evripidis Bampis; Frédéric Guinand; Denis Trystram

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
697 KB
Volume
94
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comparability graph augmentation for som
Comparability graph augmentation for some multiprocessor scheduling problems
✍ P. Dell'Olmo; M.Grazia Speranza; Zs. Tuza 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 944 KB

A comparability graph is a graph which admits a transitive orientation. In this paper we consider the problem of augmenting a graph to a comparability graph in such a way that the maximum weight of its cliques is minimum. The problem is equivalent to a multiprocessor scheduling problem and to the i

Makespan minimization in the two-machine
Makespan minimization in the two-machine flowshop batch scheduling problem
✍ T.C.E. Cheng; B.M.T. Lin; A. Toker 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB 👁 2 views

In this paper we consider a practical scheduling problem commonly arising from batch production in a flexible manufacturing environment. Different part-types are to be produced in a flexible manufacturing cell organized into a two-stage production line. The jobs are processed in batches on the first