Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness
From MaRDI portal
Publication:4632972
DOI10.1002/nav.21744zbMath1411.90158OpenAlexW2626322824MaRDI QIDQ4632972
Huiqiao Su, Guohua Wan, Michael L. Pinedo
Publication date: 2 May 2019
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.21744
Related Items (5)
Scheduling wagons to unload in bulk cargo ports with uncertain processing times ⋮ An exact quadratic programming approach based on convex reformulation for seru scheduling problems ⋮ Mixed Integer Linear Programming for a Real-World Parallel Machine Scheduling Problem with Workforce and Precedence Constraints ⋮ Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers ⋮ Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
This page was built for publication: Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness
