Hybrid rollout approaches for the job shop scheduling problem (Q1014017)
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: Hybrid rollout approaches for the job shop scheduling problem |
scientific article; zbMATH DE number 5547275
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hybrid rollout approaches for the job shop scheduling problem |
scientific article; zbMATH DE number 5547275 |
Statements
Hybrid rollout approaches for the job shop scheduling problem (English)
0 references
24 April 2009
0 references
In the paper a rollout approach is applied to the deterministic job shop scheduling problem. The aim is to find a feasible solution for which the makespan is minimized. Several priority dispatch rules and their combinations are considered. A hybrid approach defined by combining a construction heuristic and a local search method is proposed. The computational results are presented. A set of experimental instances is taken from three classes of well known benchmark problems.
0 references
job shop scheduling
0 references
rollout algorithms
0 references
hybrid approach
0 references
priority dispatch rule
0 references
local search methods
0 references
0 references
0 references
0.809992253780365
0 references
0.782880961894989
0 references
0.7824578285217285
0 references
0.7778888940811157
0 references
0.7765309810638428
0 references
