The two-machine flow shop problem with arbitrary precedence relations (Q2366083)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 223237
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The two-machine flow shop problem with arbitrary precedence relations |
scientific article; zbMATH DE number 223237 |
Statements
The two-machine flow shop problem with arbitrary precedence relations (English)
0 references
29 June 1993
0 references
The 2-machine flow shop scheduling problem with arbitrary precedence constraints is considered. The objective is to minimize the makespan. The problem is known to be NP-hard in the strong sense. A branch-and-bound algorithm is proposed for the solution. Lower bounds are computed by solving relaxed problems in which precedence constraints are reduced to a series-parallel form. The problem with series-parallel precedence constraints is \(O(n \log n)\) solvable. Here \(n\) is the number of jobs to be processed. Results of computational experiments with up to 100 jobs are included.
0 references
lower bounds
0 references
2-machine flow shop scheduling
0 references
precedence constraints
0 references
makespan
0 references
branch-and-bound
0 references
0 references
0.9062767028808594
0 references
0.8973891139030457
0 references
0.8651897311210632
0 references
