Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties

DOI10.1287/opre.26.6.1079zbMath0413.90031OpenAlexW2170455088MaRDI QIDQ3048559

Robert L. Papineall, Ram Lakshmanan, Sankaran Lakshminarayan, Rene Rochette

Publication date: 1978

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.26.6.1079

zbMATH Keywords

computational complexityearliness and tardiness penaltiessingle-machine schedulingcomparison of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Due window scheduling for parallel machines, Genetic search with dynamic operating disciplines, A survey on scheduling problems with due windows, A dual criteria sequencing problem with earliness and tardiness penalties, Minmax scheduling with job-classes and earliness-tardiness costs, Maximizing the weighted number of on-time jobs in single machine scheduling with time windows, A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows, A composite heuristic for the single machine early/tardy job scheduling problem., Scheduling about a common due date with earliness and tardiness penalties, Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard, Scheduling job classes on uniform machines, Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties, A note on a due-date assignment on a two-machine flow-shop, Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties, Multicriteria scheduling problems: a survey, Optimal timing of a sequence of tasks with general completion costs, Permutation flow shop scheduling with earliness and tardiness penalties, A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden, Algorithms for a class of single-machine weighted tardiness and earliness problems, Single-machine scheduling with time windows and earliness/tardiness penalties, A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems, Single machine scheduling to minimize mean absolute lateness: A heuristic solution, A branch and bound procedure to minimize mean absolute lateness on a single processor, A survey of the state-of-the-art of common due date assignment and scheduling research, Single machine scheduling with symmetric earliness and tardiness penalties