Flow shop with job-dependent buffer requirements -- a polynomial-time algorithm and efficient heuristics (Q2181771)
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 7202266
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Flow shop with job-dependent buffer requirements -- a polynomial-time algorithm and efficient heuristics |
scientific article; zbMATH DE number 7202266 |
Statements
Flow shop with job-dependent buffer requirements -- a polynomial-time algorithm and efficient heuristics (English)
0 references
19 May 2020
0 references
flow shop
0 references
buffer
0 references
makespan
0 references
polynomial-time algorithm
0 references
Lagrangian relaxation
0 references
heuristic
0 references
0.8602679371833801
0 references
0.8579042553901672
0 references
0.8532796502113342
0 references
0.8231646418571472
0 references
