Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach
From MaRDI portal
Publication:3527930
DOI10.1080/00207540500536939zbMath1159.90409OpenAlexW2076028784MaRDI QIDQ3527930
Publication date: 1 October 2008
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540500536939
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (14)
Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ A discrete inter-species cuckoo search for flowshop scheduling problems ⋮ A data intensive heuristic approach to the two-stage streaming scheduling problem ⋮ Simulated annealing-based ant colony algorithm for tugboat scheduling optimization ⋮ A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks ⋮ Clustering and genetic algorithm based hybrid flowshop scheduling with multiple operations ⋮ A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations ⋮ Makespan minimization on single batch-processing machine via ant colony optimization ⋮ The hybrid flow shop scheduling problem ⋮ Scheduling multistage hybrid flowshops with multiprocessor tasks by an effective heuristic ⋮ A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility ⋮ A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem ⋮ A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time ⋮ Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint
Cites Work
- A multi-stage parallel-processor flowshop problem with minimum flowtime
- Branch and bound crossed with GA to solve hybrid flowshops
- Scheduling a two-stage hybrid flow shop with parallel machines at the first stage
- Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.
- Hybrid flow-shop scheduling problems with multiprocessor task systems.
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- An ant colony system for permutation flow-shop sequencing
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Two-Stage, Hybrid Flowshop Scheduling Problem
- A computational study of heuristics for two-stage flexible flowshops
- Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times
- Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
This page was built for publication: Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach
