A generalized constructive algorithm using insertion-based heuristics
From MaRDI portal
Publication:342160
DOI10.1016/J.COR.2015.07.009zbMATH Open1349.90335OpenAlexW1456477517MaRDI QIDQ342160FDOQ342160
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
Recommendations
- \(N\)-NEH+ algorithm for solving permutation flow shop problems
- On recent modifications and extensions of the NEH heuristic for flow shop sequencing
- An improved NEH-based heuristic for the permutation flowshop problem
- A new constructive heuristic for the flowshop scheduling problem
- An improved NEH heuristic to minimize makespan in permutation flow shops
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Emergency response in natural disaster management: allocation and scheduling of rescue units
- Optimal two- and three-stage production schedules with set-up time included
- An effective and simple heuristic for the set covering problem
- A comprehensive review and evaluation of permutation flowshop heuristics
- Benchmarks for basic scheduling problems
- An improved NEH heuristic to minimize makespan in permutation flow shops
- Flowshop scheduling research after five decades
- Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance
- An integrated approach for earthwork allocation, sequencing and routing
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Flowshop-scheduling problems with makespan criterion: a review
- 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
- Heuristics for the dynamic facility layout problem with unequal-area departments
- A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
- Hyper-heuristic approaches for the response time variability problem
- New block properties for the permutation flow shop problem with application in tabu search
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- Exact and heuristic methods for the selective maintenance problem
- Capacitated arc routing problem with deadheading demands
- A constructive heuristic for the undirected rural postman problem
- Construction heuristics for the asymmetric TSP.
Cited In (3)
This page was built for publication: A generalized constructive algorithm using insertion-based heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342160)
