✦ LIBER ✦

Multicriteria dynamic scheduling by swapping of dispatching rules

✍ Scribed by Amol Singh; N. K. Mehta; P. K. Jain

Book ID: 105851923
Publisher: Springer
Year: 2006
Tongue: English
Weight: 324 KB
Volume: 34
Category: Article
ISSN: 0268-3768
DOI: 10.1007/s00170-006-0674-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient dispatching rules for dynamic

Efficient dispatching rules for dynamic job shop scheduling

✍ P. D. D. Dominic; S. Kaliyamoorthy; M. Saravana Kumar 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 291 KB

Job Shop Scheduling with Dynamic Fuzzy S

Job Shop Scheduling with Dynamic Fuzzy Selection of Dispatching Rules

✍ V. Subramaniam; T. Ramesh; G. K. Lee; Y. S. Wong; G. S. Hong 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 104 KB

Multicriteria scheduling of dynamic prod

Multicriteria scheduling of dynamic production activities

✍ Jan Wȩglarz 📂 Article 📅 1988 🏛 Elsevier Science ⚖ 462 KB

Evolutionary generation of dispatching r

Evolutionary generation of dispatching rule sets for complex dynamic scheduling problems

✍ Pickardt, Christoph W.; Hildebrandt, Torsten; Branke, Jürgen; Heger, Jens; Schol 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 556 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

Dispatching rule selection using artific

Dispatching rule selection using artificial neural networks for dynamic planning and scheduling

✍ Huajie Liu; Jian (John) Dong 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 978 KB

To schedule a job shop, the first task is to select an appropriate scheduling algorithm or rule. Because of the complexity of scheduling problems, no general algorithm sufficient for solving all scheduling problems has yet been developed. Most job-shop scheduling systems offer alternative algorithms