A reactive iterated greedy algorithm for the no-wait flowshop to minimize total tardiness

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
Some heuristics for no-wait flowshops with total tardiness criterion
Topology of septics with the set of singularities \(\mathbf B_{4,4} \oplus 2\mathbf A_3 \oplus 5\mathbf A_1\) and \(\pi_1\)-equivalent weak Zariski pairs
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
A general heuristic for vehicle routing problems
A reactive GRASP and path relinking for a combined production-distribution problem
Reactive GRASP for the strip-packing problem
Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
An update on the comparison of MIP, CP and hybrid approaches for mixed resource allocation and scheduling
A survey of scheduling problems with no-wait in process
A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
Two models for a family of flowshop sequencing problems
Iterated greedy algorithms for a complex parallel machine scheduling problem
No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan
A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem
Minimizing total tardiness in no-wait flowshops
New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness
Computing in Operations Research Using Julia
Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
Comparative evaluation of MILP flowshop models
An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window
A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness

This page was built for publication: A reactive iterated greedy algorithm for the no-wait flowshop to minimize total tardiness

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