✦ LIBER ✦

Complexity of shop-scheduling problems with fixed number of jobs: a survey

✍ Scribed by Peter Brucker; Yu N. Sotskov; Frank Werner

Publisher: Springer
Year: 2007
Tongue: English
Weight: 367 KB
Volume: 65
Category: Article
ISSN: 0340-9422
DOI: 10.1007/s00186-006-0127-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of shop-scheduling proble

The complexity of shop-scheduling problems with two or three jobs

✍ Yu.N. Sotskov 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 553 KB

A polynomial algorithm for the two machi

A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs

✍ Peter Brucker 📂 Article 📅 1994 🏛 Springer 🌐 German ⚖ 289 KB

Complexity of optimal scheduling problem

Complexity of optimal scheduling problems with three jobs

✍ Yu. N. Sotskov 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 569 KB

On the Complexity of Non-preemptive Shop

On the Complexity of Non-preemptive Shop Scheduling with Two Jobs

✍ Tamás Kis 📂 Article 📅 2002 🏛 Springer Vienna 🌐 English ⚖ 149 KB

Low-complexity algorithms for sequencing

Low-complexity algorithms for sequencing jobs with a fixed number of job-classes

✍ Jack A.A. van der Veen; Shuzhong Zhang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 691 KB

A tutorial survey of job-shop scheduling

A tutorial survey of job-shop scheduling problems using genetic algorithms: Part II. Hybrid genetic search strategies

✍ Runwei Cheng; Mitsuo Gen; Yasuhiro Tsujimura 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 395 KB

Job-shop scheduling problem is one of the well-known hardest combinatorial optimization problems. During the past decade, two important issues have been extensively studied. One is how to encode a solution into a chromosome so as to ensure that a chromosome will correspond to a feasible solution. Th