A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem

DOI10.1016/j.ejor.2003.06.045zbMath1062.90025OpenAlexW2084565928MaRDI QIDQ1771351

Luciane Ferreira Alcoforado, Nelson F. Maculan, Cláudio Thomás Bornstein

Publication date: 21 April 2005

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

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

zbMATH Keywords

Combinatorial optimizationPreemptive schedulingParallel machines scheduling problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Scheduling jobs on parallel machines to minimize a regular step total cost function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing the number of tardy jobs in single machine sequencing
• A state-of-the-art review of parallel-machine scheduling research
• Survey of scheduling research involving due date determination decisions
• Minimizing the number of tardy jobs for \(m\) parallel machines
• Minimizing late jobs in the general one machine scheduling problem
• Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
• Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
• Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs
• Sequencing with Earliness and Tardiness Penalties: A Review
• Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
• Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
• Linear-Time Algorithms for Scheduling on Parallel Processors
• On general routing problems
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems

This page was built for publication: A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem