An ant colony system for permutation flow-shop sequencing

DOI10.1016/S0305-0548(03)00038-8MaRDI QIDQ1433172zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 5584352
• Permutation flow shop scheduling algorithm based on ant colony optimization
• An enhanced Ant Colony System for the Sequential Ordering Problem
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
• An improved ant colony system for the sequential ordering problem
• An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed
• On solving permutation scheduling problems with ant colony optimization
• scientific article; zbMATH DE number 1706205
• An ant colony optimization algorithm for shop scheduling problems

Cites work

• scientific article; zbMATH DE number 5345853 (Why is no real title available?)
• scientific article; zbMATH DE number 4048925 (Why is no real title available?)
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 1249654 (Why is no real title available?)
• scientific article; zbMATH DE number 710069 (Why is no real title available?)
• scientific article; zbMATH DE number 1488087 (Why is no real title available?)
• scientific article; zbMATH DE number 1488569 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• A genetic algorithm for flowshop sequencing
• A new heuristic method for the flow shop sequencing problem
• A stochastic heuristic visualising graph clusters in a bi-dimensional space prior to partitioning
• An Evaluation of Flow Shop Sequencing Heuristics
• An improved ant system algorithm for the vehicle routing problem
• Ant colonies for the quadratic assignment problem
• Ants can colour graphs
• Benchmarks for basic scheduling problems
• Equation of state calculations by fast computing machines
• New approaches for heuristic search: A bilateral linkage with artificial intelligence
• Tabu Search—Part I
• Tabu Search—Part II

Cited in

(27)

• scientific article; zbMATH DE number 5584352 (Why is no real title available?)
• On a novel multi-swarm fruit fly optimization algorithm and its application
• Mixed integer linear programming models for flow shop scheduling with a demand plan of job types
• USING ANT COLONY OPTIMIZATION TO MINIMIZE THE FUZZY MAKESPAN AND TOTAL WEIGHTED FUZZY COMPLETION TIME IN FLOW SHOP SCHEDULING PROBLEMS
• scientific article; zbMATH DE number 2013530 (Why is no real title available?)
• 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 survey for the quadratic assignment problem
• Multiple colony ant algorithm for job-shop scheduling problem
• An improved ant colony system for the sequential ordering problem
• Flowshop-scheduling problems with makespan criterion: a review
• Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach
• ABC-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times
• Ant Colony System for JSP
• Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
• An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
• The evolution of schematic representations of flow shop scheduling problems
• Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
• ACS-TS: Train scheduling using ant colony system
• Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem
• Minimizing shifts for personnel task scheduling problems: a three-phase algorithm
• An empirical analysis of the optimality rate of flow shop heuristics
• Permutation flow shop scheduling algorithm based on ant colony optimization
• A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
• Supercomputer Scheduling with Combined Evolutionary Techniques

Describes a project that uses

Uses Software

• HAS-SOP
• HAS-QAP
• AntNet

This page was built for publication: An ant colony system for permutation flow-shop sequencing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1433172)