Minimizing the makespan for the flow shop scheduling problem with availability constraints. (Q1420378)
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: Minimizing the makespan for the flow shop scheduling problem with availability constraints. |
scientific article; zbMATH DE number 2035725
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing the makespan for the flow shop scheduling problem with availability constraints. |
scientific article; zbMATH DE number 2035725 |
Statements
Minimizing the makespan for the flow shop scheduling problem with availability constraints. (English)
0 references
2 February 2004
0 references
Scheduling
0 references
Availability constraints
0 references
Genetic algorithm
0 references
Tabu search
0 references
0 references
0 references
0 references
