One machine scheduling to minimize expected mean tardiness. II
From MaRDI portal
Publication:1332812
DOI10.1016/0305-0548(94)90008-6zbMath0820.90050MaRDI QIDQ1332812
Publication date: 13 October 1994
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(94)90008-6
90B35: Deterministic scheduling theory in operations research
Related Items
Cites Work
- Unnamed Item
- One machine scheduling to minimize expected mean tardiness. I
- A decomposition algorithm for the single machine total tardiness problem
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Minimizing Total Costs in One-Machine Scheduling
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- A hybrid algorithm for the one machine sequencing problem to minimize total tardiness