An ant colony system for permutation flow-shop sequencing

DOI10.1016/S0305-0548(03)00038-8zbMath1048.90113OpenAlexW1992350316MaRDI QIDQ1433172

Kuo-Ching Ying, Ching-Jong Liao

Publication date: 15 June 2004

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

Full work available at URL: https://doi.org/10.1016/s0305-0548(03)00038-8

zbMATH Keywords

SchedulingAnt colony systemMeta-heuristicPermutation flow-shop

Mathematics Subject Classification ID

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

Related Items

On a novel multi-swarm fruit fly optimization algorithm and its application ⋮ A survey for the quadratic assignment problem ⋮ Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm ⋮ ABC-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times ⋮ An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups ⋮ Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem ⋮ A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem ⋮ Multiple colony ant algorithm for job-shop scheduling problem ⋮ Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach ⋮ A modified ant colony system for solving the travelling salesman problem with time windows ⋮ A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation ⋮ Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm ⋮ Supercomputer Scheduling with Combined Evolutionary Techniques ⋮ Minimizing shifts for personnel task scheduling problems: a three-phase algorithm ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ Mixed integer linear programming models for flow shop scheduling with a demand plan of job types ⋮ The evolution of schematic representations of flow shop scheduling problems ⋮ USING ANT COLONY OPTIMIZATION TO MINIMIZE THE FUZZY MAKESPAN AND TOTAL WEIGHTED FUZZY COMPLETION TIME IN FLOW SHOP SCHEDULING PROBLEMS ⋮ An empirical analysis of the optimality rate of flow shop heuristics ⋮ Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach

Uses Software

• AntNet
• HAS-QAP
• HAS-SOP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New approaches for heuristic search: A bilateral linkage with artificial intelligence
• A new heuristic method for the flow shop sequencing problem
• A genetic algorithm for flowshop sequencing
• An improved ant system algorithm for the vehicle routing problem
• A stochastic heuristic visualising graph clusters in a bi-dimensional space prior to partitioning
• Benchmarks for basic scheduling problems
• Ant colonies for the quadratic assignment problem
• Tabu Search—Part I
• Tabu Search—Part II
• An Evaluation of Flow Shop Sequencing Heuristics
• Ants can colour graphs
• Equation of State Calculations by Fast Computing Machines
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem