A new branch and bound algorithm for minimizing the weighted number of tardy jobs

DOI10.1007/BF02216825zbMath0717.90035MaRDI QIDQ2638922

Guochun Tang

Publication date: 1990

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

single machinesequencingweighted number of tardy jobsbranch-and- bound

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (8)

New algorithms for minimizing the weighted number of tardy jobs on a single machine ⋮ 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 survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ Reducing tardy batches by \textit{seru} production: model, exact solution, cooperative coevolution solution, and insights ⋮ Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs ⋮ Minimizing the weighted number of tardy jobs on a single machine: strongly correlated instances ⋮ Minimizing the weighted number of tardy jobs on a single machine

Cites Work

• Unnamed Item
• Minimizing Total Costs in One-Machine Scheduling
• Algorithms for Scheduling Independent Tasks
• A dual algorithm for the one-machine scheduling problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• An experimental comparison of solution algorithms for the single-machine tardiness problem
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems

This page was built for publication: A new branch and bound algorithm for minimizing the weighted number of tardy jobs