Solving then-job 3-stage flexible flowshop scheduling problem using an agent-based approach

DOI10.1080/00207540310001602946zbMath1069.90038OpenAlexW1983145214MaRDI QIDQ4823496

David He, Astghik Babayan

Publication date: 28 October 2004

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540310001602946

zbMATH Keywords

flowshop scheduling problemagent-based approach

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Distributed scheduling: a review of concepts and applications ⋮ 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 ⋮ An Ant-bidding Algorithm for Multistage Flowshop Scheduling Problem: Optimization and Phase Transitions ⋮ The hybrid flow shop scheduling problem ⋮ A job shop distributed scheduling based on Lagrangian relaxation to minimise total completion time

Cites Work

• Scheduling jobs with release dates and tails on identical machines to minimize the makespan
• Minimizing makespan in hybrid flowshops
• Coalitions among computationally bounded agents
• Coalition structure generation with worst case guarantees
• Optimal two- and three-stage production schedules with setup times included
• Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
• The Complexity of Flowshop and Jobshop Scheduling
• Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
• A New Heuristic for Three-Machine Flow Shop Scheduling
• The Nucleolus of a Characteristic Function Game
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem