Single Machine Earliness-Tardiness Scheduling Problems Using the Equal–Slack Rule

DOI10.1038/sj/jors/0450512zbMath0807.90065OpenAlexW4253025728MaRDI QIDQ4301312

Oguz, Ceyda, Cemal Dinçer

Publication date: 21 July 1994

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

Full work available at URL: https://doi.org/10.1038/sj/jors/0450512

zbMATH Keywords

sum of earliness and tardiness penaltiesnonpreemptive single machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Minmax scheduling with job-classes and earliness-tardiness costs ⋮ A note: minmax due-date assignment problem with lead-time cost ⋮ Single machine scheduling to minimize total weighted tardiness ⋮ An SA/TS mixture algorithm for the scheduling tardiness problem ⋮ Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method ⋮ An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups ⋮ Single machine scheduling with symmetric earliness and tardiness penalties

This page was built for publication: Single Machine Earliness-Tardiness Scheduling Problems Using the Equal–Slack Rule