A Strong Preemptive Relaxation for Weighted Tardiness and Earliness/Tardiness Problems on Unrelated Parallel Machines
From MaRDI portal
Publication:2942689
DOI10.1287/ijoc.2014.0615zbMath1327.90074OpenAlexW2140141330MaRDI QIDQ2942689
Publication date: 11 September 2015
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/8ea6d13dc1d29f27bf58fe20a518ebe0aa8a308d
lower boundheuristicunrelated parallel machinestransportation problemBenders decompositionweighted tardinesspreemptive relaxationweighted earliness and tardiness
Related Items (12)
Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times ⋮ An exact extended formulation for the unrelated parallel machine total weighted completion time problem ⋮ On the mass COVID-19 vaccination scheduling problem ⋮ Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date ⋮ An exact quadratic programming approach based on convex reformulation for seru scheduling problems ⋮ Efficient algorithms for flexible job shop scheduling with parallel machines ⋮ Dynamic scheduling of patients in emergency departments ⋮ On the exact solution of a large class of parallel machine scheduling problems ⋮ Exact methods for order acceptance and scheduling on unrelated parallel machines ⋮ A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ Order assignment and scheduling under processing and distribution time uncertainty
This page was built for publication: A Strong Preemptive Relaxation for Weighted Tardiness and Earliness/Tardiness Problems on Unrelated Parallel Machines
