A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date

DOI10.1016/j.ejor.2005.11.015zbMath1102.90024OpenAlexW2028324047MaRDI QIDQ856323

Kuo-Ching Ying, Shuo-Yan Chou, Shih-Wei Lin

Publication date: 7 December 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.11.015

zbMATH Keywords

heuristicsschedulingcommon due datesingle-machineearliness--tardiness penalties

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Variable Parameters Lengths Genetic Algorithm for Minimizing Earliness-Tardiness Penalties of Single Machine Scheduling With a Common Due Date ⋮ Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models ⋮ Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date ⋮ Permutation flow shop scheduling with earliness and tardiness penalties

Cites Work

• Survey of scheduling research involving due date determination decisions
• Scheduling around a small common due date
• Using tabu search to solve the common due date early/tardy machine scheduling problem
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
• Scheduling with monotonous earliness and tardiness penalties
• Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
• Minimizing the average deviation of job completion times about a common due date
• Sequencing with Earliness and Tardiness Penalties: A Review
• Single-machine scheduling to minimize absolute deviation of completion times from a common due date
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• 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
• Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates