An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. (Q1422367)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. |
scientific article |
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
