Single Machine Earliness-Tardiness Scheduling Problems Using the Equal–Slack Rule
From MaRDI portal
Recommendations
- Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method
- Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
- Single-machine scheduling of unit-time jobs with earliness and tardiness penalties
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
Cited in
(9)- An SA/TS mixture algorithm for the scheduling tardiness problem
- Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method
- An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups
- Single machine scheduling to minimize total weighted tardiness
- Single machine scheduling with symmetric earliness and tardiness penalties
- An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem
- A note: minmax due-date assignment problem with lead-time cost
- Fifty years of research in scheduling -- theory and applications
- Minmax scheduling with job-classes and earliness-tardiness costs
This page was built for publication: Single Machine Earliness-Tardiness Scheduling Problems Using the Equal–Slack Rule
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4301312)
