scientific article; zbMATH DE number 1563208
From MaRDI portal
Publication:4761372
Recommendations
- Single-machine scheduling with a common due window
- Minimizing weighted number of early and tardy jobs with a common due window involving location penalty
- Earliness-tardiness scheduling problems with a common delivery window
- Determination of the CDW to minimize the weighted number of early and tardy jobs
- Scheduling with a common due-window: polynomially solvable cases
Cited in
(14)- A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs
- Earliness-tardiness scheduling problems with a common delivery window
- Minimizing weighted number of early and tardy jobs with a common due window involving location penalty
- Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
- Scheduling with a common due-window: polynomially solvable cases
- Single machine earliness/tardiness scheduling problem with additional penalties about due window
- An interlacing form scheduling problem with a common due window
- A Scheduling Problem with One Producer and the Bargaining Counterpart with Two Producers
- HEURISTIC ALGORITHMS FOR A SINGLE-MACHINE COMMON DUE DATE ASSIGNMENT UNDER EARLINESS/TARDINESS MEASURE
- scientific article; zbMATH DE number 7448659 (Why is no real title available?)
- Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs
- Determination of the CDW to minimize the weighted number of early and tardy jobs
- Single-machine scheduling with a common due window
- Parallel machine scheduling with a common due window
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4761372)
