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

DOI10.3934/JIMO.2024044MaRDI QIDQ6574085FDOQ6574085

Authors Bruno A. Prata, Levi R. Abreu, Marcelo Seido Nagano 

Publication date 18 July 2024

Published in Journal of Industrial and Management Optimization (Search for Journal in Brave)

zbMATH Keywords

constraint programmingno-wait flowshopproduction schedulingmixed-integer linear programmingreactive iterated greedy

Mathematics Subject Classification ID

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

Recommendations

• A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion
• No-wait flowshop scheduling problem with two criteria; total tardiness and makespan
• Minimizing total tardiness in no-wait flowshops
• An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
• Some heuristics for no-wait flowshops with total tardiness criterion

Cites Work

• A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
• A general heuristic for vehicle routing problems
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
• A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness
• A reactive GRASP and path relinking for a combined production-distribution problem
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• A survey of scheduling problems with no-wait in process
• An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
• An update on the comparison of MIP, CP and hybrid approaches for mixed resource allocation and scheduling
• Comparative evaluation of MILP flowshop models
• Computing in operations research using Julia
• Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window
• Iterated greedy algorithms for a complex parallel machine scheduling problem
• Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
• Minimizing total tardiness in no-wait flowshops
• Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem
• NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
• New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness
• No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan
• Reactive GRASP for the strip-packing problem
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• 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
• Two models for a family of flowshop sequencing problems

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)