✦ LIBER ✦

Constraint Propagation and Problem Decomposition: A Preprocessing Procedure for the Job Shop Problem

✍ Scribed by Ulrich Dorndorf; Erwin Pesch; Toàn Phan-Huy

Book ID: 110405190
Publisher: Springer US
Year: 2002
Tongue: English
Weight: 138 KB
Volume: 115
Category: Article
ISSN: 0254-5330
DOI: 10.1023/a:1021197120431

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The job shop tardiness problem: A decomp

The job shop tardiness problem: A decomposition approach

✍ N. Raman; F. Brian Talbot 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 899 KB

An aggregation procedure for the determi

An aggregation procedure for the deterministic job-shop problem

✍ Bernard Penz; Lionel Dupont 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 488 KB

A new approach is proposed in this paper to solve the job-shop scheduling problem. Instead of considering operations or machines, the construction of partial schedules by dealing with jobs, one after the other, is suggested. A partial schedule for given jobs is characterized by the sequence of their

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

A genetic algorithm for the job shop pro

A genetic algorithm for the job shop problem

✍ Federico Della Croce; Roberto Tadei; Giuseppe Volta 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 704 KB

Heuristic Control of a Constraint-Based

Heuristic Control of a Constraint-Based Algorithm for the Preemptive Job-Shop Scheduling Problem

✍ Claude Le Pape; Philippe Baptiste 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 314 KB

A hybrid single and dual population sear

A hybrid single and dual population search procedure for the job shop scheduling problem

✍ Veronique Sels; Kjeld Craeymeersch; Mario Vanhoucke 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 552 KB