Single machine weighted earliness-tardiness penalty problem with a common due date

DOI10.1016/S0305-0548(99)00153-7zbMath0990.90045OpenAlexW1992128882MaRDI QIDQ5939971

Sakib A. Mondal, Anup K. Sen

Publication date: 25 August 2002

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(99)00153-7

zbMATH Keywords

branch and boundsingle machine scheduling

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items

A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time, Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach, Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance, Minimizing total earliness and tardiness on a single machine using a hybrid heuristic, Multiple machine JIT scheduling: a tabu search approach, Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration

Cites Work

• Unnamed Item
• Unnamed Item
• An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date
• Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
• Minimizing mean absolute deviation of completion times about a common due date
• Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
• Single-machine scheduling to minimize absolute deviation of completion times from a common due date
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• New Lower and Upper Bounds for Scheduling Around a Small Common Due Date