A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion

DOI10.1016/J.COR.2019.104839zbMATH Open1458.90349OpenAlexW2985844211WikidataQ126845547 ScholiaQ126845547MaRDI QIDQ2297561FDOQ2297561

Authors: Vahid Riahi, Raymond Chiong, Yuli Zhang 

Publication date: 20 February 2020

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

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

Recommendations

• A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
• A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
• MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem
• Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
• A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion

zbMATH Keywords

flowshop schedulingNEHIGAno-idle permutation

Mathematics Subject Classification ID

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

Cites Work

• Metaheuristics. From design to implementation.
• Benchmarks for basic scheduling problems
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
• A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion
• A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
• Local search methods for the flowshop scheduling problem with flowtime minimization
• A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time
• Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
• Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
• Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
• A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
• An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
• The flow shop problem with no-idle constraints: a review and approximation
• Constraint guided accelerated search for mixed blocking permutation flowshop scheduling
• Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
• A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion

Cited In (10)

• A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
• A reactive iterated greedy algorithm for the no-wait flowshop to minimize total tardiness
• New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems
• A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
• A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion
• Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion
• Accelerating the calculation of makespan used in scheduling improvement heuristics
• MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem
• Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups
• A systematic literature review on no-idle flow shop scheduling problem

This page was built for publication: A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion

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