An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments
From MaRDI portal
Publication:4474722
DOI10.1080/00207540310001612026zbMath1052.90585OpenAlexW2086755976MaRDI QIDQ4474722
Shie-Gheun Koh, Robert L. Bulfin
Publication date: 12 July 2004
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540310001612026
Related Items (1)
Cites Work
- Focused simulated annealing search: An application to job shop scheduling
- Stochastic Scheduling with Priority Classes
- Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties
- A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness
- Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
- Scheduling with Fixed Delivery Dates
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications
- Focused Scheduling in Proportionate Flowshops
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
- A Single Machine Model for Determination of Optimal Due Dates and Sequence
- A dual algorithm for the one-machine scheduling problem
- Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem
This page was built for publication: An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments
