Dynamic single-machine scheduling under distributed decision-making

DOI10.1080/00207540050175996MaRDI QIDQ4525600zbMATH OpenOpenAlexFDO

Authors

Publication date 2000

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

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

Mathematics Subject Classification ID

Production models (90B30)

Recommendations

• Auction-based distributed scheduling in a dynamic job shop environment
• Dynamic scheduling of stochastic jobs on a single machine
• Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm
• Dynamic non-preemptive single machine scheduling
• A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms

Cited in

(8)

• The single-node dynamic service scheduling and dispatching problem
• A job shop distributed scheduling based on Lagrangian relaxation to minimise total completion time
• Distributed scheduling: a review of concepts and applications
• Analytical models to predict the performance of a single-machine system under periodic and event-driven rescheduling strategies
• Auction-based distributed scheduling in a dynamic job shop environment
• A job scheduling approach based on a learning automaton for a distributed computing system
• Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems
• Distributed feedback control algorithm for dynamic truck loading scheduling problem

This page was built for publication: Dynamic single-machine scheduling under distributed decision-making

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4525600)