Scheduling job families about an unrestricted common due date on a single machine
From MaRDI portal
Publication:4252121
Recommendations
- A genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due date
- The complexity of scheduling job families about a common due date
- Single machine weighted earliness-tardiness penalty problem with a common due date
- The weighted common due date single machine scheduling problem revisited
- Scheduling to minimize weighted earliness and tardiness about a common due-date
Cited in
(13)- The complexity of scheduling job families about a common due date
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Earliness-tardiness scheduling with setup considerations
- A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time
- Integrated batch sizing and scheduling on a single machine
- A survey of scheduling problems with setup times or costs
- Multicriteria scheduling problems: a survey
- A genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due date
- Counting and enumeration complexity with application to multicriteria scheduling
- Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date
- Batch sizing and just-in-time scheduling with common due date
- Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
- Scheduling with returnable containers
This page was built for publication: Scheduling job families about an unrestricted common due date on a single machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252121)