A generalized constructive algorithm using insertion-based heuristics
From MaRDI portal
Publication:342160
DOI10.1016/j.cor.2015.07.009zbMath1349.90335OpenAlexW1456477517MaRDI QIDQ342160
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.07.009
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem, PERMGEN
Cites Work
- Unnamed Item
- An integrated approach for earthwork allocation, sequencing and routing
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
- An effective and simple heuristic for the set covering problem
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Some efficient heuristic methods for the flow shop sequencing problem
- An improved NEH-based heuristic for the permutation flowshop problem
- Exact and heuristic methods for the selective maintenance problem
- Heuristics for the dynamic facility layout problem with unequal-area departments
- Capacitated arc routing problem with deadheading demands
- A comprehensive review and evaluation of permutation flowshop heuristics
- Emergency response in natural disaster management: allocation and scheduling of rescue units
- Hyper-heuristic approaches for the response time variability problem
- Benchmarks for basic scheduling problems
- A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
- An improved NEH heuristic to minimize makespan in permutation flow shops
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- A constructive heuristic for the undirected rural postman problem
- Flowshop scheduling research after five decades
- Optimal two- and three-stage production schedules with setup times included
- Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance
- New block properties for the permutation flow shop problem with application in tabu search
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
- Flowshop-scheduling problems with makespan criterion: a review
- Construction heuristics for the asymmetric TSP.
