On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness (Q3659516)
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 3811298
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness |
scientific article; zbMATH DE number 3811298 |
Statements
On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness (English)
0 references
1983
0 references
branch-and-bound algorithm
0 references
two-machine scheduling problem
0 references
arbitrary number of machines
0 references
lower bounds
0 references
relaxation
0 references
computational experience
0 references
