Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
From MaRDI portal
Publication:1427562
DOI10.1016/S0377-2217(02)00908-6zbMath1045.90032MaRDI QIDQ1427562
Hans Ziegler, Chandrasekharan Rajendran
Publication date: 14 March 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
An effective differential evolution algorithm for permutation flow shop scheduling problem ⋮ A real-time order acceptance and scheduling approach for permutation flow shop problems ⋮ A two-phase scheduling method with the consideration of task clustering for Earth observing satellites ⋮ A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem ⋮ A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem ⋮ A discrete inter-species cuckoo search for flowshop scheduling problems ⋮ A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem ⋮ Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops ⋮ A discrete version of particle swarm optimization for flowshop scheduling problems ⋮ Considering scheduling and preventive maintenance in the flowshop sequencing problem ⋮ Local search methods for the flowshop scheduling problem with flowtime minimization ⋮ An Ant-bidding Algorithm for Multistage Flowshop Scheduling Problem: Optimization and Phase Transitions ⋮ A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems ⋮ An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed ⋮ Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach ⋮ A unified framework for population-based metaheuristics ⋮ Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems ⋮ Ant colony optimization for the job rotation scheduling problem ⋮ An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives ⋮ A bicriteria flowshop scheduling with a learning effect ⋮ A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation ⋮ A heuristic approach to find the global optimum of function ⋮ An improved NEH heuristic to minimize makespan in permutation flow shops ⋮ Cooperative metaheuristics for the permutation flowshop scheduling problem ⋮ Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm ⋮ An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion ⋮ Flow shop scheduling with heterogeneous workers ⋮ Scheduling of multiple in-line steppers for semiconductor wafer fabs ⋮ An improved particle swarm optimization algorithm for flowshop scheduling problem ⋮ Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion ⋮ Scheduling job shop associated with multiple routings with genetic and ant colony heuristics ⋮ Design and validation of heuristic algorithms for simulation-based scheduling of a semiconductor Backend facility ⋮ Fast heuristics for minimizing the makespan in non-permutation flow shops ⋮ A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times ⋮ An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ USING ANT COLONY OPTIMIZATION TO MINIMIZE THE FUZZY MAKESPAN AND TOTAL WEIGHTED FUZZY COMPLETION TIME IN FLOW SHOP SCHEDULING PROBLEMS ⋮ Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues ⋮ A bi-level programming framework for stochastic replenishment policy in a supply chain: approach and computational test ⋮ A hybrid genetic local search algorithm for the permutation flowshop scheduling problem ⋮ An empirical analysis of the optimality rate of flow shop heuristics ⋮ A heuristic hybrid framework for vector job scheduling ⋮ The distributed permutation flowshop scheduling problem ⋮ Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization ⋮ A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs ⋮ Allocation of advertising space by a web service provider using combinatorial auctions ⋮ Unnamed Item ⋮ A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
Cites Work
- A new heuristic method for the flow shop sequencing problem
- Modified simulated annealing algorithms for the flow shop sequencing problem
- Flowshop sequencing with mean flowtime objective
- A fast tabu search algorithm for the permutation flow-shop problem
- Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- A tabu search approach for the flow shop scheduling problem
- Heuristics for scheduling in flowshop with multiple objectives
- A heuristic algorithm for mean flowtime objective in flowshop scheduling
- Benchmarks for basic scheduling problems
- Optimal two- and three-stage production schedules with setup times included
- ANALYSIS FOR MINIMIZING WEIGHTED MEAN FLOW-TIME IN FLOW-SHOP SCHEDULING
- Two-Stage Flowshop Scheduling Problem with Bicriteria
- AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
