✦ LIBER ✦

A dynamic priority rule for scheduling against due-dates

✍ Scribed by Kenneth R. Baker; J.W.M. Bertrand

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 603 KB
Volume: 3
Category: Article
ISSN: 0272-6963
DOI: 10.1016/0272-6963(82)90020-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A due date density-based categorising he

A due date density-based categorising heuristic for parallel machines scheduling

✍ S.-S. Kim; H.J. Shin; D.-H. Eom; C.-O. Kim 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 356 KB

Fuzzy rule generation for adaptive sched

Fuzzy rule generation for adaptive scheduling in a dynamic manufacturing environment

✍ Key K. Lee 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 669 KB

An efficient dynamic dispatching rule fo

An efficient dynamic dispatching rule for scheduling in a job shop

✍ T.S. Raghu; Chandrasekharan Rajendran 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 951 KB

A priority rule for minimizing weighted

A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems

✍ S.T. Webster 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 541 KB

A study of due-date assignment rules wit

A study of due-date assignment rules with constrained tightness in a dynamic job shop

✍ Feng-Chang R. Chang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 327 KB

Search heuristics for a parallel machine

Search heuristics for a parallel machine scheduling problem with ready times and due dates

✍ Moon-Won Park; Yeong-Dae Kim 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 348 KB

We consider a problem of scheduling orders on identical parallel machines An order can be released after a given ready time and must be completed before its due date An order is split into multiple jobs (batches) and a job is processed on one of the parallel machines The objective of the scheduling