Pages that link to "Item:Q2770081"
From MaRDI portal
The following pages link to A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness (Q2770081):
Displayed 9 items.
- Sensitivity bounds for machine scheduling with uncertain communication delays (Q880514) (← links)
- Decomposition methods for large job shops (Q1592580) (← links)
- Maximization of solution flexibility for robust shop scheduling (Q1772837) (← links)
- An extended enterprise planning methodology for the discrete manufacturing industry (Q1840855) (← links)
- Executing production schedules in the face of uncertainties: a review and some future directions (Q1887777) (← links)
- A new sufficient condition of optimality for the two-machine flowshop problem (Q2572845) (← links)
- An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments (Q4474722) (← links)
- Parallel Machine Scheduling with Uncertain Communication Delays (Q4809662) (← links)
- An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments (Q4823493) (← links)