Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs

DOI10.1016/S0020-0190(98)00153-7zbMath1337.90026MaRDI QIDQ293435

Wiesław X. Kubiak, Valery S. Gordon

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001537?np=y

zbMATH Keywords

algorithmscomputational complexitysingle machine schedulingdue date assignmentrelease

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Single machine scheduling with assignable due dates ⋮ A single machine scheduling with generalized and periodic due dates to minimize total deviation ⋮ Bicriteria scheduling for due date assignment with total weighted tardiness ⋮ Single machine scheduling with assignable due dates to minimize maximum and total late work ⋮ Order acceptance and scheduling with delivery under generalized parameters ⋮ Batch scheduling of deteriorating reworkables ⋮ Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms ⋮ Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates

Cites Work

• On the complexity of generalized due date scheduling problems
• Unnamed Item
• Unnamed Item
• Unnamed Item