A single machine scheduling problem with earliness/tardiness and starting time penalties under a common due date

DOI10.1016/0305-0548(92)90015-WzbMath0767.90041OpenAlexW1991107708MaRDI QIDQ1195100

U. G. Joo, Chang Sup Sung

Publication date: 5 October 1992

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

Full work available at URL: https://doi.org/10.1016/0305-0548(92)90015-w

zbMATH Keywords

common due dateheuristic solution algorithmsingle machine non-preemptive sequencing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date ⋮ Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs ⋮ Scheduling with batch setup times and earliness-tardiness penalties

Cites Work

• Optimal common due-date with limited completion time
• CON due-date determination and sequencing
• A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem
• Optimal common due-date with limited completion time deviation
• Minimizing the average deviation of job completion times about a common due date
• Sequencing with Earliness and Tardiness Penalties: A Review
• Single- and multiple-processor models for minimizing completion time variance
• Determination of an optimal common due date and optimal sequence in a single machine job shop
• The Single Machine Early/Tardy Problem
• Single-machine scheduling to minimize absolute deviation of completion times from a common due date
• Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties