Minimizing the weighted number of tardy jobs on a single machine

DOI10.1016/S0377-2217(02)00180-7zbMath1012.90009OpenAlexW2040516673MaRDI QIDQ1869424

Robert L. Bulfin, Rym M'Hallah

Publication date: 10 April 2003

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00180-7

zbMATH Keywords

schedulingcombinatorial optimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (12)

MP or not MP: that is the question ⋮ New algorithms for minimizing the weighted number of tardy jobs on a single machine ⋮ Maximizing the weighted number of just-in-time jobs in flow shop scheduling ⋮ Minimizing the weighted number of tardy jobs on parallel processors ⋮ Minimizing the weighted number of tardy jobs on a single machine with release dates ⋮ A binary multiple knapsack model for single machine scheduling with machine unavailability ⋮ A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ Scheduling linear deteriorating jobs to minimize the number of tardy jobs ⋮ Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances ⋮ Minimizing the weighted number of tardy jobs on a single machine: strongly correlated instances ⋮ Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains

Cites Work

• Unnamed Item
• Unnamed Item
• Minimizing late jobs in the general one machine scheduling problem
• A new branch and bound algorithm for minimizing the weighted number of tardy jobs
• Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
• Algorithms for Scheduling Independent Tasks
• 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: Minimizing the weighted number of tardy jobs on a single machine