Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness

DOI10.1016/S0377-2217(98)00111-8zbMath0969.90044OpenAlexW2062591712MaRDI QIDQ1296374

Mikhail Y. Kovalyov, Cheng, T. C. Edwin

Publication date: 29 November 1999

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00111-8

zbMATH Keywords

parallel machine schedulingdue date assignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Related Items (5)

Single machine scheduling with assignable due dates ⋮ A note: minmax due-date assignment problem with lead-time cost ⋮ Single machine scheduling with assignable due dates to minimize maximum and total late work ⋮ Single machine scheduling to minimize total weighted tardiness ⋮ Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Survey of scheduling research involving due date determination decisions
• Processing-plus-wait due dates in single-machine scheduling
• Sequencing with Earliness and Tardiness Penalties: A Review
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The parallel machine min-max weighted absolute lateness scheduling problem

This page was built for publication: Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness