A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
type: Item
instance of: scholarly article
title: A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
zbMATH Open document ID: 1426.90141
author: Yanyan Li
published in: Applied Mathematical Modelling
publication date: 2018-10-09T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6949394
zbMATH Keywords: artificial bee colony algorithm
zbMATH Keywords: no-idle permutation flowshop scheduling problem
zbMATH Keywords: metaheuristics
zbMATH Keywords: evolutionary algorithms
zbMATH Keywords: genetic algorithm
describes a project that uses: ABC
MaRDI profile type: Publication
full work available at URL: j.apm.2013.02.011
OpenAlex ID: W2004843387
cites work: Flowshop-scheduling problems with makespan criterion: a review
cites work: A comprehensive review and evaluation of permutation flowshop heuristics
cites work: Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
cites work: Scheduling in flowshops to minimize total tardiness of jobs
cites work: Q4841579
cites work: A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time
cites work: Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
cites work: Note: On the two-machine no-idle flowshop problem
cites work: Minimizing total elapsed time subject to zero total idle time of machines in \(n\times 3\) flowshop problem.
cites work: A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
cites work: Flowshop/no-idle scheduling to minimise the mean flowtime
cites work: Flowshop/no-idle scheduling to minimize total elapsed time
cites work: On no-wait and no-idle flow shops with makespan criterion
cites work: Some efficient heuristic methods for the flow shop sequencing problem
cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
cites work: Benchmarks for basic scheduling problems
cites work: A new design method based on artificial bee colony algorithm for digital IIR filters
cites work: A comparative study of artificial bee colony algorithm
cites work: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
cites work: Some local search algorithms for no-wait flow-shop problem with makespan criterion
cites work: An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
cites work: A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
DOI: 10.1016/J.APM.2013.02.011
description: scientific article; zbMATH DE number 6949394