A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date
From MaRDI portal
(Redirected from Publication:856323)
Recommendations
- A single machine scheduling problem with earliness/tardiness and starting time penalties under a common due date
- Single-machine scheduling to minimize earliness and number of tardy jobs
- The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm
- Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
- Scheduling to minimize weighted earliness and tardiness about a common due-date
Cites work
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
- Minimizing the average deviation of job completion times about a common due date
- Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
- Scheduling around a small common due date
- Scheduling with monotonous earliness and tardiness penalties
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single-machine scheduling to minimize absolute deviation of completion times from a common due date
- Survey of scheduling research involving due date determination decisions
- Using tabu search to solve the common due date early/tardy machine scheduling problem
Cited in
(6)- Permutation flow shop scheduling with earliness and tardiness penalties
- Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
- Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
- A single machine scheduling problem with earliness/tardiness and starting time penalties under a common due date
- Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models
- Variable parameters lengths genetic algorithm for minimizing earliness-tardiness penalties of single machine scheduling with a common due date
This page was built for publication: A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856323)
