A hybrid heuristic approach for single machine scheduling with release times

DOI10.1016/J.COR.2013.11.016zbMATH Open1348.90250OpenAlexW1986426354MaRDI QIDQ336949FDOQ336949

Authors Fabio Salassa, Vincent T'kindt, F. Della Croce

Publication date 10 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2013.11.016

zbMATH Keywords

integer programmingmatheuristicspositional completion times

Mathematics Subject Classification ID

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

Recommendations

• Two very large-scale neighborhoods for single machine scheduling
• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
• A heuristic algorithm to minimize total weighted tardiness on a single machine with release times
• Near-optimal solutions of large-scale single-machine scheduling problems
• Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates

Cites work

• scientific article; zbMATH DE number 91757 (Why is no real title available?)
• A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
• A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
• A matheuristic approach for the two-machine total completion time flow shop problem
• An algorithm for single machine sequencing with release dates to minimize total weighted completion time
• Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates
• Dominance-based heuristics for one-machine total cost scheduling problems
• Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.
• Local branching
• Matheuristics
• Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
• Revisiting branch and bound search strategies for machine scheduling problems

Cited in

(12)

• Terminal penalty rolling scheduling based on an initial schedule for single-machine scheduling problem
• Order scheduling with tardiness objective: improved approximate solutions
• A locally optimal insertion heuristic for a one-machine scheduling problem
• Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates
• Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
• MP or not MP: that is the question
• An iterative heuristic for the single machine dynamic total completion time scheduling problem
• Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs
• Two very large-scale neighborhoods for single machine scheduling
• Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times
• Heuristic methods for the single-machine scheduling problem with periodical resource constraints
• Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness

This page was built for publication: A hybrid heuristic approach for single machine scheduling with release times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336949)