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/00207540310001612026zbMATH Open1052.90585OpenAlexW2086755976MaRDI QIDQ4474722FDOQ4474722
Authors: 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
Cites Work
- Scheduling with Fixed Delivery Dates
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Guided local search with shifting bottleneck for job shop scheduling
- Single-machine scheduling of unit-time jobs with earliness and tardiness penalties
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem
- An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
- Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
- A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness
- Focused Scheduling in Proportionate Flowshops
- A dual algorithm for the one-machine scheduling problem
- Stochastic scheduling with priority classes
- Stochastic scheduling on parallel machines subject to random breakdowns to minimize expected costs for earliness and tardy jobs
- A Single Machine Model for Determination of Optimal Due Dates and Sequence
- Focused simulated annealing search: An application to job shop scheduling
Cited In (1)
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)
