A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
From MaRDI portal
Recommendations
- A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion
- A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion
- A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion
- MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem
- A hybrid discrete artificial bee colony algorithm for the permutation flow shop scheduling
Cites work
- A comparative study of artificial bee colony algorithm
- A comprehensive review and evaluation of permutation flowshop heuristics
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- A new design method based on artificial bee colony algorithm for digital IIR filters
- A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time
- A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- Benchmarks for basic scheduling problems
- Flowshop-scheduling problems with makespan criterion: a review
- Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
- Flowshop/no-idle scheduling to minimise the mean flowtime
- Flowshop/no-idle scheduling to minimize total elapsed time
- scientific article; zbMATH DE number 782644 (Why is no real title available?)
- Minimizing total elapsed time subject to zero total idle time of machines in \(n\times 3\) flowshop problem.
- Note: On the two-machine no-idle flowshop problem
- On no-wait and no-idle flow shops with makespan criterion
- Scheduling in flowshops to minimize total tardiness of jobs
- Some efficient heuristic methods for the flow shop sequencing problem
- Some local search algorithms for no-wait flow-shop problem with makespan criterion
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
Cited in
(19)- 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
- A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion
- A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion
- Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
- Using artificial bee colony algorithm for permutation flow shop scheduling problem under makespan criterion
- 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
- 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
- On clarifying misconceptions when comparing variants of the artificial bee colony algorithm by offering a new implementation
- Scheduling the flowshop with zero intermediate storage using chaotic discrete artificial bee algorithm
- A systematic literature review on no-idle flow shop scheduling problem
- A systematic review of permutation flow shop scheduling with due-date-related objectives
- A review on the versions of artificial bee colony algorithm for scheduling problems
- A speed-up procedure and new heuristics for the classical job shop scheduling problem: a computational evaluation
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1788967)
