Single Machine Scheduling to Minimize Total Weighted Late Work
From MaRDI portal
Publication:4896450
DOI10.1287/ijoc.7.2.232zbMath0859.90084OpenAlexW2104178995MaRDI QIDQ4896450
A. M. A. Hariri, Chris N. Potts, Luk N. Van Wassenhove
Publication date: 20 October 1996
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/065cb77a0e6b3e833d1c513e599d6010d288778b
Related Items (25)
Two-agent scheduling problems on a single-machine to minimize the total weighted late work ⋮ Approximation algorithms for minimizing the total weighted tardiness on a single machine ⋮ Pareto-scheduling of two competing agents with their own equal processing times ⋮ Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date ⋮ Minimizing total weighted late work on a single-machine with non-availability intervals ⋮ Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work ⋮ Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work ⋮ Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work ⋮ A no-delay single machine scheduling problem to minimize total weighted early and late work ⋮ Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work ⋮ Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work ⋮ A survey of due-date related single-machine with two-agent scheduling problem ⋮ A note on a two-agent scheduling problem related to the total weighted late work ⋮ A new perspective on single-machine scheduling problems with late work related criteria ⋮ Single-machine scheduling with multi-agents to minimize total weighted late work ⋮ Scheduling on parallel identical machines with late work criterion: offline and online cases ⋮ Two competitive agents to minimize the weighted total late work and the total completion time ⋮ Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work ⋮ On the approximability of the two-phase knapsack problem ⋮ Minimizing total late work on a single machine with generalized due-dates ⋮ Minimizing total weighted late work in the resource-constrained project scheduling problem ⋮ Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date ⋮ Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems ⋮ A Parallel Machine Scheduling Problem Maximizing Total Weighted Early Work
This page was built for publication: Single Machine Scheduling to Minimize Total Weighted Late Work
