Lead time selection and the behaviour of work flow in job shops
From MaRDI portal
Publication:1296700
DOI10.1016/S0377-2217(97)00013-1zbMath0951.90023OpenAlexW2035464407MaRDI QIDQ1296700
Publication date: 2 August 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00013-1
Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22)
Related Items
Multi-agent-based workload control for make-to-order manufacturing ⋮ Makespan estimation in batch process industries: A comparison between regression analysis and neural networks
Cites Work
- Unnamed Item
- Survey of scheduling research involving due date determination decisions
- Job shop leadtime requirements under conditions of controlled delivery performance
- Setting Job-Shop Due-Dates with Service-Level Constraints
- Optimal due-date assignment in a job shop†
- Approximations for the time spent in a dynamic job shop with applications to due-date assignment
- A Proof for the Queuing Formula: L = λW
- Due Date Assignment for Production Systems
- Due-Date Setting and Priority Sequencing in a Multiclass M/G/1 Queue
- A Broader View of the Job-Shop Scheduling Problem
- Due-Dates and Instantaneous Load in the One-Machine Shop
- A Simulation Study of Predictable Due-Dates
- A dynamic forecasting model for job shop flowtime prediction and tardiness control
- Quoting Customer Lead Times
