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):
Displaying 28 items.
- Taking advantage of a diverse set of efficient production schedules: a two-step approach for scheduling with side concerns (Q336423) (← links)
- A hybrid differential evolution and tree search algorithm for the job shop scheduling problem (Q410367) (← links)
- New competitive results for the stochastic resource-constrained project scheduling problem: exploring the benefits of pre-processing (Q539456) (← links)
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective (Q614062) (← links)
- A robust approach for the single machine scheduling problem (Q835547) (← links)
- Sensitivity bounds for machine scheduling with uncertain communication delays (Q880514) (← links)
- Hybrid rollout approaches for the job shop scheduling problem (Q1014017) (← links)
- Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case (Q1046704) (← links)
- Decomposition methods for large job shops (Q1592580) (← links)
- Risk measure of job shop scheduling with random machine breakdowns (Q1654341) (← links)
- Extended GRASP for the job shop scheduling problem with total weighted tardiness objective (Q1753631) (← links)
- On the optimality conditions of the two-machine flow shop problem (Q1754105) (← 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 theoretic and practical framework for scheduling in a stochastic environment (Q2268505) (← links)
- Solve-and-robustify (Q2268511) (← links)
- Schedule execution for two-machine flow-shop with interval processing times (Q2390053) (← links)
- A new sufficient condition of optimality for the two-machine flowshop problem (Q2572845) (← links)
- Optimizing makespan and stability risks in job shop scheduling (Q2664315) (← links)
- Accelerating the calculation of makespan used in scheduling improvement heuristics (Q2668662) (← 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)
- Exact Algorithms for Distributionally <i>β</i>-Robust Machine Scheduling with Uncertain Processing Times (Q5137951) (← links)
- Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems (Q6106966) (← links)
- Dynamic surgery management under uncertainty (Q6112637) (← links)
- Two-stage stochastic/robust scheduling based on permutable operation groups (Q6596975) (← links)
