Due window scheduling for parallel machines
From MaRDI portal
Publication:1341402
DOI10.1016/0895-7177(94)90208-9zbMATH Open0810.90073OpenAlexW1989533809MaRDI QIDQ1341402FDOQ1341402
Authors: V. Pereyra
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
Recommendations
- Soft due window assignment and scheduling of unit-time jobs on parallel machines
- Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs
- Minmax scheduling problems with a common due-window
- Parallel machine scheduling with a common due window
- Scheduling with a common due-window: polynomially solvable cases
Cites Work
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Sequencing with Earliness and Tardiness Penalties: A Review
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- Optimal common due-date with limited completion time deviation
- Minimizing the average deviation of job completion times about a common due date
- Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
- Title not available (Why is that?)
- Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
- Due window scheduling for parallel machines
- Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
- Error Bound of a Heuristic for the Common Due Date Scheduling Problem
Cited In (19)
- Hierarchical production planning and scheduling in a multi-product, batch process environment
- Parallel machine scheduling with a common due window
- A batching scheduling algorithm for maximizing total weighed number of jobs completed in due data window
- On scheduling around large restrictive common due windows
- Tackling common due window problem with a two-layered approach
- A Due-Window Determination In Minmax Scheduling Problems
- Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
- Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window
- Earliness-tardiness scheduling problems with a common delivery window
- Title not available (Why is that?)
- Unbounded batch scheduling with a common due window on a single machine
- Parallel machine scheduling with due date-to-deadline window, order sharing and time value of money
- Scheduling identical jobs and due-window on uniform machines
- Due window scheduling for parallel machines
- A survey on scheduling problems with due windows
- Determination of common due window location in a single machine scheduling problem
- Soft due window assignment and scheduling of unit-time jobs on parallel machines
- Scheduling with a common due-window: polynomially solvable cases
- Parallel machine scheduling with common due windows
This page was built for publication: Due window scheduling for parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1341402)