A branch and bound algorithm for the job-shop scheduling problem (Q1327223)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A branch and bound algorithm for the job-shop scheduling problem |
scientific article; zbMATH DE number 590198
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm for the job-shop scheduling problem |
scientific article; zbMATH DE number 590198 |
Statements
A branch and bound algorithm for the job-shop scheduling problem (English)
0 references
18 July 1994
0 references
A fast branch-and-bound algorithm for the job-shop scheduling problem is described. Among other hard problems it solves to optimality the \(10\times 10\) benchmark problem which has been open for a long time. Implementation on a workstation and encouraging computational results are presented.
0 references
branch-and-bound
0 references
job-shop scheduling
0 references
