An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed
DOI10.1016/J.COR.2010.11.010zbMATH Open1208.90078OpenAlexW2076422645MaRDI QIDQ632673FDOQ632673
Authors: R. F. Tavares Neto, Moacir Godinho Filho 
Publication date: 25 March 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.11.010
Recommendations
- Permutation flow shop scheduling algorithm based on ant colony optimization
- scientific article; zbMATH DE number 5584352
- Multiple colony ant algorithm for job-shop scheduling problem
- Minimizing total tardiness on a single machine using ant colony optimization
- Using artificial bee colony algorithm for permutation flow shop scheduling problem under makespan criterion
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Ant colony optimization.
- Ant colony optimization theory: a survey
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
- Scheduling
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Scheduling algorithms
- A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- An improved ant system algorithm for the vehicle routing problem
- Minimizing total tardiness on a single machine using ant colony optimization
- Ant algorithms: theory and applications
- Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem
Cited In (15)
- Coordinated \textit{seru} scheduling and distribution operation problems with DeJong's learning effects
- Q-learning algorithm performance for M-machine, N-jobs flow shop scheduling problems to minimize makespan
- Title not available (Why is that?)
- Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic
- Ant colony algorithm for traffic signal timing optimization
- Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach
- An ant colony system for permutation flow-shop sequencing
- Scheduling of two-machine flowshop with outsourcing lead-time
- Clarifying cutting and sewing processes with due windows using an effective ant colony optimization
- An improved central force optimization algorithm for multimodal optimization
- A new approach for maintenance scheduling of generating units in electrical power systems based on their operational hours
- Minimizing total tardiness on a single machine using ant colony optimization
- Permutation flow shop scheduling algorithm based on ant colony optimization
- Outsourcing and scheduling for a two-machine flow shop with release times
- Scheduling with divisible jobs and subcontracting option
This page was built for publication: An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632673)
