Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment
From MaRDI portal
Publication:1302578
DOI10.1016/S0305-0548(98)00055-0zbMath0956.90012OpenAlexW2078757281WikidataQ127098620 ScholiaQ127098620MaRDI QIDQ1302578
Valery S. Gordon, Vitaly A. Strusevich
Publication date: 11 May 2000
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(98)00055-0
Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)
Related Items (11)
Single machine scheduling with assignable due dates ⋮ Job sequencing and due date assignment in a single machine shop with uncertain processing times ⋮ A note: minmax due-date assignment problem with lead-time cost ⋮ `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders ⋮ Scheduling problems with partially ordered jobs ⋮ Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine ⋮ Vyacheslav Tanaev: contributions to scheduling and related areas ⋮ Scheduling with due date assignment under special conditions on job processing ⋮ Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties ⋮ Single machine scheduling with precedence constraints and positionally dependent processing times ⋮ Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms
This page was built for publication: Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment
