A weighted modified due date rule for sequencing to minimize weighted tardiness
From MaRDI portal
Publication:2464422
DOI10.1023/B:JOSH.0000031421.64487.95zbMath1154.90465OpenAlexW2079786340MaRDI QIDQ2464422
Publication date: 20 December 2007
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:josh.0000031421.64487.95
Related Items (13)
On the flexibility of a decision theory-based heuristic for single machine scheduling ⋮ Decomposition methods for cost and tardiness reduction in aircraft manufacturing flow lines ⋮ Heuristic approaches for scheduling jobs in large-scale flexible job shops ⋮ Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling ⋮ Genetic programming-based hyper-heuristic approach for solving dynamic job shop scheduling problem with extended technical precedence constraints ⋮ Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming ⋮ New heuristics for total tardiness minimization in a flexible flowshop ⋮ Aversion scheduling in the presence of risky jobs ⋮ Extended GRASP for the job shop scheduling problem with total weighted tardiness objective ⋮ Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem ⋮ Minimizing mean weighted tardiness in unrelated parallel machine scheduling with reinforcement learning ⋮ Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times ⋮ A survey of scheduling with parallel batch (p-batch) processing
This page was built for publication: A weighted modified due date rule for sequencing to minimize weighted tardiness
