✦ LIBER ✦

Stability of an optimal schedule

✍ Scribed by Y.N. Stoskov

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 572 KB
Volume: 55
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(91)90194-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Stability of optimal structured schedule

✍ N. B. Lebedinskaya; T. E. Safonova 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 485 KB

An algorithm for constructing an optimal

An algorithm for constructing an optimal structural schedule

✍ N. B. Lebedinskaya 📂 Article 📅 1985 🏛 Springer US 🌐 English ⚖ 610 KB

The stability of high-speed optimal sche

The stability of high-speed optimal schedules

✍ Yu.N. Sotskov 📂 Article 📅 1989 🏛 Elsevier Science ⚖ 521 KB

An optimal schedule time of a job shop-l

An optimal schedule time of a job shop-like disjunctive graph

✍ S. Ashour; K. Y. Chiu; T. E. Moore 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 812 KB

## Abstract This paper considers the shop scheduling problem which involves both job precedence and machine interference constraints. Based on the graph‐theoretical representation of the problem, a branch‐and‐bound algorithm is proposed for implicitly producing an optimal schedule such that the sch

Development of an optimal pharmacokineti

Development of an optimal pharmacokinetic sampling schedule for rubitecan administered orally in a daily times five schedule

✍ Nadja E. Schoemaker; Ron A. Mathôt; Patrick Schöffski; Hilde Rosing; Jan H. Sche 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 220 KB

An Optimal Multiprocessor Real-Time Sche

An Optimal Multiprocessor Real-Time Scheduling Algorithm

✍ Ashok Khemka; R.K. Shyamasundar 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 170 KB

An optimal scheduling algorithm is described that feasibly schedules a set of m periodic tasks on n processors before their respective deadlines, if the task set satisfies certain conditions. The complexity of this scheduling algorithm in terms of the number of scheduled tasks and the number of proc