Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs

DOI10.1016/j.ejor.2006.03.028zbMath1180.90136OpenAlexW2086992555MaRDI QIDQ858442

N. E. Zubov

Publication date: 9 January 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.03.028

zbMATH Keywords

schedulingparallel machinesnumber of tardy jobsdual resource constrained scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (9)

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Unrelated parallel machine scheduling problem with special controllable processing times and setups ⋮ Reducing tardy batches by \textit{seru} production: model, exact solution, cooperative coevolution solution, and insights ⋮ A three-stage optimization algorithm for the stochastic parallel machine scheduling problem with adjustable production rates ⋮ A simulation‐based differential evolution algorithm for stochastic parallel machine scheduling with operational considerations ⋮ Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem ⋮ Bi-objective parallel machine scheduling with additional resources during setups ⋮ Production, maintenance and resource scheduling: a review ⋮ Parallel machine scheduling with additional resources: notation, classification, models and solution methods

Cites Work

• Scheduling with flexible resources in parallel workcenters to minimize maximum completion time
• Minimizing the number of tardy jobs for \(m\) parallel machines
• Heuristics for parallel-machine flexible-resource scheduling problems with unspecified job assignment
• Scheduling problems for parallel dedicated machines under multiple resource constraints.
• The impact of resource flexibility and staffing decisions on cellular and departmental shop performance
• Makespan minimization on uniform parallel machines with release times
• Minimizing the weighted number of tardy jobs on parallel processors
• Scheduling Parallel Manufacturing Cells with Resource Flexibility
• Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

This page was built for publication: Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs