✦ LIBER ✦

A new lower bound for the job-shop scheduling problem

✍ Scribed by Peter Brucker; Bernd Jurisch

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 611 KB
Volume: 64
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(93)90174-l

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Genetic neuro-scheduler: A new approach

Genetic neuro-scheduler: A new approach for job shop scheduling

✍ C.H. Dagli; S. Sittisathanchai 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 729 KB

Helper-objective optimization strategies

Helper-objective optimization strategies for the Job-Shop Scheduling Problem

✍ Darrell F. Lochtefeld; Frank W. Ciarallo 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 451 KB

An interactive approach for a dual-const

An interactive approach for a dual-constraint job shop scheduling problem

✍ Suna Kondakci; Rajiv M. Gupta 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 644 KB

An efficient memetic algorithm for solvi

An efficient memetic algorithm for solving the job shop scheduling problem

✍ Liang Gao; Guohui Zhang; Liping Zhang; Xinyu Li 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 741 KB

## a b s t r a c t The job shop scheduling problem (JSP) is well known as one of the most complicated combinatorial optimization problems, and it is a NP-hard problem. Memetic algorithm (MA) which combines the global search and local search is a hybrid evolutionary algorithm. In this paper, an eff

An improved lower bound for a bi-criteri

An improved lower bound for a bi-criteria scheduling problem

✍ Jin Yan 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 133 KB

A pseudo-polynomial algorithm for a two-

A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem

✍ Wieslaw Kubiak 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 273 KB