A two-machine permutation flow shop scheduling problem with buffers (Q1286775)
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 two-machine permutation flow shop scheduling problem with buffers |
scientific article; zbMATH DE number 1281648
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A two-machine permutation flow shop scheduling problem with buffers |
scientific article; zbMATH DE number 1281648 |
Statements
A two-machine permutation flow shop scheduling problem with buffers (English)
0 references
29 April 1999
0 references
scheduling
0 references
heuristics
0 references
two-machine flow-shop
0 references
buffer
0 references
tabu search
0 references
just-in-time
0 references
flexible manufacturing systems
0 references
minimum makespan
0 references
two-machine permutation flow-shop
0 references
0.90340918302536
0 references
0.8563501834869385
0 references
0.8458113074302673
0 references
0.8425887227058411
0 references
0.8251407146453857
0 references
