A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. (Q1427559): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The permutation flow shop with buffers: A tabu search approach / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The flow shop with parallel machines: A tabu search approach / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling flexible flow lines with no in-process buffers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Adaptable Scheduling Algorithm for Flexible Flow Lines / rank | |||
Normal rank | |||
Latest revision as of 14:29, 6 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. |
scientific article |
Statements
A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. (English)
0 references
14 March 2004
0 references
Flowshop scheduling
0 references
Parallel machines
0 references
Buffer constraints
0 references
Minimizing makespan
0 references
0 references
