The weighted common due date single machine scheduling problem revisited
From MaRDI portal
Publication:1919202
DOI10.1016/0305-0548(95)O0025-OzbMath0855.90072OpenAlexW2036957865MaRDI QIDQ1919202
Publication date: 3 February 1997
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(95)o0025-o
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time ⋮ Machine scheduling with earliness, tardiness and non-execution penalties ⋮ Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach ⋮ Minimizing total earliness and tardiness on a single machine using a hybrid heuristic ⋮ RTSS: An interactive decision support system for solving real time scheduling problems considering customer and job priorities with schedule interruptions. ⋮ A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios ⋮ Minimization of total absolute deviation for a common due date ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research
Cites Work
- Parametric precedence relations in single machine scheduling
- Scheduling around a small common due date
- Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
- Sequencing with Earliness and Tardiness Penalties: A Review
- The Single Machine Problem with a Quadratic Cost Function of Completion Times
- 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
