A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion

DOI10.1016/j.apm.2013.02.011zbMath1426.90141OpenAlexW2004843387MaRDI QIDQ1788967

Yanyan Li

Publication date: 9 October 2018

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2013.02.011

zbMATH Keywords

metaheuristicsgenetic algorithmevolutionary algorithmsartificial bee colony algorithmno-idle permutation flowshop scheduling problem

Mathematics Subject Classification ID

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

Related Items (14)

Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion ⋮ On the exact solution of the no-wait flow shop problem with due date constraints ⋮ A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion ⋮ Artificial bee colony algorithm combined with grenade explosion method and Cauchy operator for global optimization ⋮ 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 ⋮ A systematic literature review on no-idle flow shop scheduling problem ⋮ A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion ⋮ On clarifying misconceptions when comparing variants of the artificial bee colony algorithm by offering a new implementation ⋮ Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling ⋮ A multi-objective multi-population ant colony optimization for economic emission dispatch considering power system security ⋮ A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion ⋮ Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion ⋮ Scheduling the Flowshop with Zero Intermediate Storage Using Chaotic Discrete Artificial Bee Algorithm

Uses Software

• ABC

Cites Work

• Unnamed Item
• Flowshop/no-idle scheduling to minimize total elapsed time
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• On no-wait and no-idle flow shops with makespan criterion
• Some efficient heuristic methods for the flow shop sequencing problem
• A new design method based on artificial bee colony algorithm for digital IIR filters
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
• Minimizing total elapsed time subject to zero total idle time of machines in \(n\times 3\) flowshop problem.
• A comprehensive review and evaluation of permutation flowshop heuristics
• A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
• Benchmarks for basic scheduling problems
• A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time
• Some local search algorithms for no-wait flow-shop problem with makespan criterion
• A comparative study of artificial bee colony algorithm
• A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
• A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
• Flowshop/no-idle scheduling to minimise the mean flowtime
• Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
• Note: On the two-machine no-idle flowshop problem
• Scheduling in flowshops to minimize total tardiness of jobs
• Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
• Flowshop-scheduling problems with makespan criterion: a review

This page was built for publication: A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion