An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. (Q1422367)
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: An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. |
scientific article; zbMATH DE number 2041857
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. |
scientific article; zbMATH DE number 2041857 |
Statements
An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. (English)
0 references
14 February 2004
0 references
Scheduling
0 references
Open shop
0 references
Tabu search
0 references
Tardiness
0 references
0 references
