A generalized constructive algorithm using insertion-based heuristics

DOI10.1016/J.COR.2015.07.009MaRDI QIDQ342160zbMATH OpenOpenAlexFDO

Authors Milos Danilovic, Oliver Ilic

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

zbMATH Keywords

makespanNP-complete problemsflowshopinsertion moveNEH heuristicpermutations numbering

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

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

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• A comprehensive review and evaluation of permutation flowshop heuristics
• A constructive heuristic for the undirected rural postman problem
• A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
• A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• An effective and simple heuristic for the set covering problem
• An improved NEH heuristic to minimize makespan in permutation flow shops
• An improved NEH-based heuristic for the permutation flowshop problem
• An integrated approach for earthwork allocation, sequencing and routing
• Benchmarks for basic scheduling problems
• Capacitated arc routing problem with deadheading demands
• Comparison of heuristics for flowtime minimisation in permutation flowshops
• Construction heuristics for the asymmetric TSP.
• Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance
• Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
• Emergency response in natural disaster management: allocation and scheduling of rescue units
• Exact and heuristic methods for the selective maintenance problem
• Flowshop scheduling research after five decades
• Flowshop-scheduling problems with makespan criterion: a review
• Heuristics for the dynamic facility layout problem with unequal-area departments
• 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
• Optimal two- and three-stage production schedules with set-up time included
• Some efficient heuristic methods for the flow shop sequencing problem
• Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts

Cited in

(4)

• \(N\)-NEH+ algorithm for solving permutation flow shop problems
• PERMGEN
• A generalized insertion algorithm for the seriation problem
• Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem

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)