An Ant-bidding Algorithm for Multistage Flowshop Scheduling Problem: Optimization and Phase Transitions

DOI10.1007/978-3-540-72960-0_6zbMath1211.90081OpenAlexW1866381414MaRDI QIDQ3509420

Vince Darley, Bala Ramachandran, Alberto V. Donati

Publication date: 1 July 2008

Published in: Natural Computing Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72960-0_6

zbMATH Keywords

local searchsetup timesupply chaindynamic capacityschedule problem

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A fast tabu search algorithm for the permutation flow-shop problem
• Minimizing makespan in hybrid flowshops
• New heuristics for no-wait flowshops to minimize makespan.
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
• Modelling multi-stage manufacturing systems for efficient scheduling
• Benchmarks for basic scheduling problems
• Ant colonies for the quadratic assignment problem
• Ants can colour graphs
• An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
• Solving then-job 3-stage flexible flowshop scheduling problem using an agent-based approach
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

This page was built for publication: An Ant-bidding Algorithm for Multistage Flowshop Scheduling Problem: Optimization and Phase Transitions