A game-theoretic control approach for job shops in the presence of disruptions
From MaRDI portal
Publication:4394284
Recommendations
- Rescheduling job shops under random disruptions
- A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness
- scientific article; zbMATH DE number 1836388
- An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments
- Scheduling job shops with delays
Cites work
- An Algorithm for Solving the Job-Shop Problem
- Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs
- scientific article; zbMATH DE number 3770836 (Why is no real title available?)
- Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
- On scheduling with ready-times, due-dates and vacations
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- The Shifting Bottleneck Procedure for Job Shop Scheduling
Cited in
(5)- Executing production schedules in the face of uncertainties: a review and some future directions
- From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future
- Comparing deterministic, robust and online scheduling using entropy
- scientific article; zbMATH DE number 1836388 (Why is no real title available?)
- Two machine scheduling under disruptions with transportation considerations
This page was built for publication: A game-theoretic control approach for job shops in the presence of disruptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4394284)