✦ LIBER ✦

Surgical case scheduling as a generalized job shop scheduling problem

✍ Scribed by Dinh-Nguyen Pham; Andreas Klinkert

Book ID: 108118147
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 494 KB
Volume: 185
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2006.03.059

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Hybrid Algorithm for Flexible Job-Shop

A Hybrid Algorithm for Flexible Job-Shop Scheduling Problem

✍ Jianchao Tang; Guoji Zhang; Binbin Lin; Bixi Zhang 📂 Article 📅 2011 🏛 Elsevier 🌐 English ⚖ 256 KB

A Rollout Metaheuristic for Job Shop Sch

A Rollout Metaheuristic for Job Shop Scheduling Problems

✍ Carlo Meloni; Dario Pacciarelli; Marco Pranzo 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 215 KB

A new hybrid genetic algorithm for job s

A new hybrid genetic algorithm for job shop scheduling problem

✍ Ren Qing-dao-er-ji; Yuping Wang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 398 KB

A search space analysis of the Job Shop

A search space analysis of the Job Shop Scheduling Problem

✍ D.C. Mattfeld; C. Bierwirth; H. Kopfer 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 194 KB

Bicriterion scheduling problem in a job

Bicriterion scheduling problem in a job shop with parallel processors

✍ Ahmed Abu Cenna; Mario T. Tabucanon 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 512 KB

A batch splitting heuristic for dynamic

A batch splitting heuristic for dynamic job shop scheduling problem

✍ Hanil Jeong; Sangbok Woo; Sukho Kang; Jinwoo Park 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 391 KB

The job shop scheduling problem has been a major target for many researchers. Unfortunately, though, most of the past studies assumed that a job consists of only a single part. If we assume that a job consists of a batch as in many real manufacturing environment, then we can obtain an improved sched