A hybrid heuristic approach for single machine scheduling with release times
From MaRDI portal
Publication:336949
DOI10.1016/j.cor.2013.11.016zbMath1348.90250OpenAlexW1986426354MaRDI QIDQ336949
Vincent T'kindt, Fabio Salassa, Frederico 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
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (6)
MP or not MP: that is the question ⋮ Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness ⋮ Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources ⋮ Order scheduling with tardiness objective: improved approximate solutions ⋮ Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs ⋮ Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times
Cites Work
- Unnamed Item
- 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
- Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.
- Local branching
- 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
- Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
- Dominance-based heuristics for one-machine total cost scheduling problems
- A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
- Revisiting branch and bound search strategies for machine scheduling problems
- Matheuristics
- A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
This page was built for publication: A hybrid heuristic approach for single machine scheduling with release times