Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine

DOI10.1023/A:1018987625819zbMath0922.90092OpenAlexW282106005MaRDI QIDQ1290164

Keisuke Tanaka, Milan Vlach

Publication date: 10 June 1999

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

Full work available at URL: https://doi.org/10.1023/a:1018987625819

zbMATH Keywords

single machinegeneralized due datesmaximum absolute latenessrange of lateness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (12)

Single machine scheduling with assignable due dates ⋮ A single machine scheduling with generalized and periodic due dates to minimize total deviation ⋮ A greedy heuristic for solving scheduling problems with bounded rejection cost ⋮ Single machine scheduling with rejection and generalized parameters ⋮ Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity ⋮ Order acceptance and scheduling with delivery under generalized parameters ⋮ Two-agent single-machine scheduling with assignable due dates ⋮ Batch scheduling of deteriorating reworkables ⋮ Minimizing total late work on a single machine with generalized due-dates ⋮ Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates ⋮ On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates ⋮ The quadratic balanced optimization problem

This page was built for publication: Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine