New approaches to due date assignment in job shops
From MaRDI portal
Publication:2426556
DOI10.1016/j.ejor.2007.02.020zbMath1149.90088OpenAlexW2047153414WikidataQ57747922 ScholiaQ57747922MaRDI QIDQ2426556
Mustafa Göçken, Zeynep D. Unutmaz, Adil Baykasoǧlu
Publication date: 22 April 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.02.020
Related Items (6)
Pooling heterogeneous products for manufacturing environments ⋮ Multiple cross-docks scheduling with multiple doors using fuzzy approach and metaheuristic algorithms ⋮ Real-time production planning and control system for job-shop manufacturing: a system dynamics analysis ⋮ Due-window assignment problems with unit-time jobs ⋮ Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine ⋮ A fuzzy model for shortage planning under uncertainty due to lack of homogeneity in planned production lots
Cites Work
- An algorithm for the CON due-date determination and sequencing problem
- Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
- Simulation study of job shop scheduling with due dates
- Heuristics for dynamic job shop scheduling with real-time updated queueing time estimates
- Alternative order release mechanisms: a comparison by simulation
- A dynamic forecasting model for job shop flowtime prediction and tardiness control
- Due-date setting methodologies based on simulated annealing—an experimental study in a real-life job shop
- The choice of dispatching rules in a shop using internally set due-dates with quoted leadtime and tardiness costs
This page was built for publication: New approaches to due date assignment in job shops
