The parallel machine min-max weighted absolute lateness scheduling problem
From MaRDI portal
Publication:4279270
DOI<33::AID-NAV3220410104>3.0.CO;2-S 10.1002/1520-6750(199402)41:1<33::AID-NAV3220410104>3.0.CO;2-SzbMath0808.90082OpenAlexW2062126231MaRDI QIDQ4279270
Chung-Lun Li, Cheng, T. C. Edwin
Publication date: 15 March 1995
Full work available at URL: https://doi.org/10.1002/1520-6750(199402)41:1<33::aid-nav3220410104>3.0.co;2-s
earlinesscommon due datetardinessNP-hard problempolynomial time heuristicoptimal non-preemptive job scheduleparallel machine min-max weighted absolute lateness problem
Related Items (18)
A survey on scheduling problems with due windows ⋮ Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach ⋮ Scheduling problems with two competing agents to minimized weighted earliness-tardiness ⋮ Single machine scheduling to minimize the number of early and tardy jobs ⋮ Minimizing total tardiness in a scheduling problem with a learning effect ⋮ Scheduling job classes on uniform machines ⋮ An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs ⋮ Minmax earliness-tardiness costs with unit processing time jobs ⋮ Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs ⋮ Multicriteria scheduling problems: a survey ⋮ Scheduling with a common due-window: polynomially solvable cases ⋮ A common due-data assignment problem on parallel identical machines ⋮ Parallel machine scheduling with a common due window ⋮ Hierarchical production planning and scheduling in a multi-product, batch process environment ⋮ Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs ⋮ Scheduling with batch setup times and earliness-tardiness penalties ⋮ Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research
Cites Work
This page was built for publication: The parallel machine min-max weighted absolute lateness scheduling problem
