Processing-plus-wait due dates in single-machine scheduling
From MaRDI portal
Recommendations
Cites work
- Completion time variance minimization on a single machine is difficult
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- scientific article; zbMATH DE number 232395 (Why is no real title available?)
- Minimising Waiting Time Variance in the Single Machine Problem
- Minimizing mean absolute deviation of completion times about a common due date
- Minimizing Variation of Flow Time in Single Machine Systems
- Optimal Due-Date Determination and Sequencing of n Jobs on a Single Machine
- Scheduling about a common due date with earliness and tardiness penalties
- Scheduling with monotonous earliness and tardiness penalties
- Sequencing with Earliness and Tardiness Penalties: A Review
- Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
- Survey of scheduling research involving due date determination decisions
- Variance Minimization in Single Machine Sequencing Problems
Cited in
(5)- Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness
- Single machine scheduling with assignable due dates
- Single machine scheduling to minimize total weighted tardiness
- A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
- Single-machine scheduling with waiting-time-dependent due dates
This page was built for publication: Processing-plus-wait due dates in single-machine scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1893346)