A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion

DOI10.1016/J.COR.2018.02.003MaRDI QIDQ1652608zbMATH OpenOpenAlexFDO

Authors Weishi Shao, Dechang Pi, Zhongshi Shao

Publication date 11 July 2018

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

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

zbMATH Keywords

discrete learning phasediscrete teaching phasemeta-heuristicno-idle flow shop scheduling problemreinforcement learningtotal tardiness

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
• A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion
• Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion
• A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion
• MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem

Cites work

• A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
• A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion
• A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
• Benchmarks for basic scheduling problems
• Design and analysis of experiments.
• Experiments with Kemeny ranking: What works when?
• Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling. Theory, algorithms, and systems.
• Teaching-learning based optimization with global crossover for global optimization problems
• Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm

Cited in

(9)

• A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
• A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion
• Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion
• MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem
• Two-machine flow-shop scheduling to minimize total late work: revisited
• An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem
• Hybrid discrete teaching-learning-based optimization algorithm for solving complex parallel machine scheduling problem
• A branch-and-bound approach to the no-idle flowshop scheduling problem
• A systematic review of permutation flow shop scheduling with due-date-related objectives

This page was built for publication: A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion

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