An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops (Q2482377): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710541407615 |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:28, 16 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops |
scientific article |
Statements
An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops (English)
0 references
16 April 2008
0 references
The author considers the problem of minimizing makespan in a two-machine no-wait job shop environment. A two-phase heuristic is developed. In the first phase the problem is reduced to a two-machine no-wait flow shop scheduling problem which is solved by the well known algorithm \textit{P. C. Gilmore} and \textit{R. E. Gomory} [Oper. Res. 12, 655--679 (1964; Zbl 0126.36006)]. In the second phase the obtained solution is improved using a tabu search algorithm. The author describes the experiments and evaluates the performance of the proposed heuristic.
0 references
scheduling
0 references
no-wait
0 references
job shop
0 references
tabu search
0 references
heuristic
0 references
