Due window scheduling for parallel machines
From MaRDI portal
Publication:1341402
DOI10.1016/0895-7177(94)90208-9zbMath0810.90073OpenAlexW1989533809MaRDI QIDQ1341402
Publication date: 11 January 1995
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0895-7177(94)90208-9
Related Items (14)
Due window scheduling for parallel machines ⋮ Earliness-tardiness scheduling problems with a common delivery window ⋮ A survey on scheduling problems with due windows ⋮ Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach ⋮ Unbounded batch scheduling with a common due window on a single machine ⋮ Soft due window assignment and scheduling of unit-time jobs on parallel machines ⋮ Tackling Common Due Window Problem with a Two-Layered Approach ⋮ Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window ⋮ On scheduling around large restrictive common due windows ⋮ Scheduling with a common due-window: polynomially solvable cases ⋮ Parallel machine scheduling with a common due window ⋮ Hierarchical production planning and scheduling in a multi-product, batch process environment ⋮ Determination of common due window location in a single machine scheduling problem ⋮ Scheduling identical jobs and due-window on uniform machines
Cites Work
- Unnamed Item
- Optimal common due-date with limited completion time deviation
- Due window scheduling for parallel machines
- Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
- Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
- Minimizing the average deviation of job completion times about a common due date
- Sequencing with Earliness and Tardiness Penalties: A Review
- 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
- Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
- Error Bound of a Heuristic for the Common Due Date Scheduling Problem
This page was built for publication: Due window scheduling for parallel machines