An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments
From MaRDI portal
Publication:4474722
Cites work
- A Single Machine Model for Determination of Optimal Due Dates and Sequence
- A dual algorithm for the one-machine scheduling problem
- A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness
- An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
- Focused Scheduling in Proportionate Flowshops
- Focused simulated annealing search: An application to job shop scheduling
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications
- Guided local search with shifting bottleneck for job shop scheduling
- Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem
- Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Scheduling with Fixed Delivery Dates
- Single-machine scheduling of unit-time jobs with earliness and tardiness penalties
- Stochastic scheduling on parallel machines subject to random breakdowns to minimize expected costs for earliness and tardy jobs
- Stochastic scheduling with priority classes
- The Shifting Bottleneck Procedure for Job Shop Scheduling
This page was built for publication: An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474722)
