Single‐machine scheduling with deadlines to minimize the total weighted late work
From MaRDI portal
Publication:5241424
DOI10.1002/nav.21869zbMath1423.90084OpenAlexW2977092953WikidataQ127200107 ScholiaQ127200107MaRDI QIDQ5241424
No author found.
Publication date: 31 October 2019
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.21869
Related Items (12)
Semi-online scheduling on two identical machines with a common due date to maximize total early work ⋮ Minimizing total weighted late work on a single-machine with non-availability intervals ⋮ Scheduling with competing agents, total late work and job rejection ⋮ Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work ⋮ Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work ⋮ Single-machine preemptive scheduling with release dates involving the total weighted late work criterion ⋮ Single-machine scheduling with multi-agents to minimize total weighted late work ⋮ Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines ⋮ Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work ⋮ Minimizing total late work on a single machine with generalized due-dates ⋮ Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works ⋮ Parallel Machine Scheduling with Due Date-to-Deadline Window, Order Sharing and Time Value of Money
This page was built for publication: Single‐machine scheduling with deadlines to minimize the total weighted late work
