✦ LIBER ✦

An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times

✍ Scribed by Janny M.Y. Leung; Eugene Levner

Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 223 KB
Volume: 34
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2005.07.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An approximation algorithm for identical

An approximation algorithm for identical parallel machine scheduling with resource dependent processing times

✍ Hans Kellerer 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 119 KB

An approximation algorithm for a single-

An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times

✍ Eugeniusz Nowicki 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 455 KB

An efficient genetic algorithm for job-s

An efficient genetic algorithm for job-shop scheduling problems with fuzzy processing time and fuzzy duedate

✍ Masatoshi Sakawa; Tetsuya Mori 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 210 KB

An approximation algorithm for the m-mac

An approximation algorithm for the m-machine permutation flow shop scheduling problem with controllable processing times

✍ Eugeniusz Nowicki 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 423 KB

An efficient scheduling algorithm for di

An efficient scheduling algorithm for distributed real-time systems with end-to-end timing constraints

✍ Atsushi Togawa; Eiji Okubo 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB

This paper proposes an efficient scheduling algorithm for distributed real-time systems with such timing constraints as jitter and end-to-end timing. Conventionally, backtrack searching and annealing methods have been used for scheduling problems when timing constraints are complicated. These method