Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights

DOI10.1287/opre.39.1.64zbMath0746.90030OpenAlexW2010592135MaRDI QIDQ3981510

Esther M. Arkin, Robin Roundy

Publication date: 26 June 1992

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.39.1.64

zbMATH Keywords

parallel machinessingle machineheuristictotal weighted tardinesspseudo- polynomial time algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

On the flexibility of a decision theory-based heuristic for single machine scheduling ⋮ Scheduling on parallel identical machines to minimize total tardiness ⋮ Scheduling parallel machines to minimize total weighted and unweighted tardiness ⋮ Minimizing total weighted completion time with an unexpected machine unavailable interval ⋮ Minimizing the average tardiness: the case of outsource machines ⋮ Dynamic scheduling of patients in emergency departments ⋮ A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property ⋮ Parallel machine scheduling considering a job-splitting property ⋮ Single machine scheduling to minimize total weighted tardiness ⋮ Algorithms for a class of single-machine weighted tardiness and earliness problems ⋮ Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration ⋮ Scheduling jobs on parallel machines with sequence-dependent setup times ⋮ A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date ⋮ Earliness and tardiness single machine scheduling with proportional weights ⋮ Parallel machine earliness and tardiness scheduling with proportional weights