✦ LIBER ✦

Hybrid meta-heuristic algorithm for job shop scheduling with due date time window and release time

✍ Scribed by Kuo, R. J.; Cheng, W. C.

Book ID: 120595778
Publisher: Springer
Year: 2013
Tongue: English
Weight: 294 KB
Volume: 67
Category: Article
ISSN: 0268-3768
DOI: 10.1007/s00170-013-4753-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Using Genetic Algorithms and Heuristics

Using Genetic Algorithms and Heuristics for Job Shop Scheduling with Sequence-Dependent Setup Times

✍ Waiman Cheung; Hong Zhou 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 131 KB

A polynomial-time algorithm for the two-

A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem

✍ Vadim G. Timkovsky 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 1014 KB

We consider a polynomial-time algorithm for the following scheduling problem: Given two machines, where each machine can process at most one job at a time; a set of jobs, where each job can start on or after its release date and consists of a chain of unit-time operations such that the machines have

Job shop scheduling with unit time opera

Job shop scheduling with unit time operations under resource constraints and release dates

✍ Jayme Luiz Szwarcfiter 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 378 KB

Preemptive Scheduling of Independent Job

Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops

✍ Yookun Cho and Sartaj Sahni 📂 Article 📅 1981 🏛 INFORMS 🌐 English ⚖ 435 KB

A hybrid local search algorithm for sche

A hybrid local search algorithm for scheduling real-world job shops with batch-wise pending due dates

✍ Rui Zhang; Cheng Wu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 730 KB

Hybrid flow shop scheduling with sequenc

Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates

✍ Ebrahimi, M.; Fatemi Ghomi, S.M.T.; Karimi, B. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 1015 KB