Name
Title | ||
|---|---|---|
Scheduling jobs with ready times and precedence constraints on parallel batch machines using metaheuristics. |
Abstract | ||
|---|---|---|
•A scheduling problem for jobs with precedence constraints on parallel batch machines is discussed.•The total weighted tardiness performance measure is considered.•A simple batch forming procedure is described.•A VNS and a GRASP scheme are proposed.•VNS outperforms the best performing algorithm from the literature. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.cie.2014.10.008 | Computers & Industrial Engineering |
Keywords | Field | DocType |
Scheduling,Batching,Parallel machines,Variable neighborhood search,Greedy randomized adaptive search | Heuristic,Mathematical optimization,Tardiness,GRASP,Job shop scheduling,Variable neighborhood search,Computer science,Shifting bottleneck heuristic,Greedy randomized adaptive search procedure,Metaheuristic | Journal |
Volume | Issue | ISSN |
78 | C | 0360-8352 |
Citations | PageRank | References |
13 | 0.56 | 19 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrew Bilyk | 1 | 13 | 0.56 |
| Lars Mönch | 2 | 1034 | 124.98 |
| Christian Almeder | 3 | 90 | 7.09 |