Scheduling flexible flow lines with no in-process buffers (Q4398979): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Branch and bound algorithm for the flow shop with multiple processors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Flowshop sequencing problems with limited buffer storage / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling with Deadlines and Loss Functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling algorithms for flexible flowshops: Worst and average case performance / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Adaptable Scheduling Algorithm for Flexible Flow Lines / rank | |||
Normal rank | |||
Latest revision as of 12:25, 28 May 2024
scientific article; zbMATH DE number 1179678
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling flexible flow lines with no in-process buffers |
scientific article; zbMATH DE number 1179678 |
Statements
Scheduling flexible flow lines with no in-process buffers (English)
0 references
30 June 1999
0 references
heuristic
0 references
flexible flow line
0 references
no intermediate buffers
0 references
