A holonic approach to flexible flow shop scheduling under stochastic processing times

DOI10.1016/J.COR.2013.09.013zbMath1348.90343OpenAlexW2116747938MaRDI QIDQ336906

Mohammad Hasan, M. Dambrine

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.09.013

zbMATH Keywords

decompositionflexible flow shopback propagation networkcontract net protocolholonic manufacturing systemneighbouring \(K\)-means clustering algorithmstochastic processing times

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36)

Uses Software

• JADE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New multi-objective method to solve reentrant hybrid flow shop scheduling problem
• Executing production schedules in the face of uncertainties: a review and some future directions
• A survey of dynamic scheduling in manufacturing systems
• Rescheduling manufacturing systems: A framework of strategies, policies, and methods
• Determination of cluster number in clustering microarray data
• An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns
• Two-Stage, Hybrid Flowshop Scheduling Problem
• Integrated process planning and scheduling/rescheduling—an agent-based approach
• Analysis of reactive scheduling problems in a job shop environment
• A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters

This page was built for publication: A holonic approach to flexible flow shop scheduling under stochastic processing times