Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
From MaRDI portal
Publication:3166272
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
- A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
- scientific article; zbMATH DE number 40477
- Minimizing total tardiness in an unrelated parallel-machine scheduling problem
- A novel B and B algorithm for a unrelated parallel machine scheduling problem to minimize the total weighted tardiness
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
Cites work
- scientific article; zbMATH DE number 40477 (Why is no real title available?)
- scientific article; zbMATH DE number 91757 (Why is no real title available?)
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
- A note on the SPT heuristic for solving scheduling problems with generalized due dates
- Conjugate gradient methods using quasi-Newton updates with inexact line searches
- Lower bounds for parallel machine scheduling problems
- Minimizing total tardiness on a single machine with unequal release dates
- On the single machine total tardiness problem
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Reducing total tardiness cost in manufacturing cell scheduling by a multi-factor priority rule
- Scheduling a single machine to minimize a regular objective function under setup constraints
- Scheduling jobs on parallel machines with sequence-dependent setup times
- Scheduling on parallel identical machines to minimize total tardiness
- Scheduling parallel machines to minimize total weighted and unweighted tardiness
Cited in
(20)- A strong preemptive relaxation for weighted tardiness and earliness/tardiness problems on unrelated parallel machines
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- A new branch and bound algorithm for minimizing the weighted number of tardy jobs
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
- Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness
- Minimizing the weighted number of tardy jobs on parallel processors
- Mathematical model and algorithm for the reefer mechanic scheduling problem at seaports
- scientific article; zbMATH DE number 91757 (Why is no real title available?)
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
- A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
- Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates
- A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- A novel B and B algorithm for a unrelated parallel machine scheduling problem to minimize the total weighted tardiness
- Dynamic scheduling of patients in emergency departments
- A branch and bound algorithm to minimize total weighted tardiness on a single processor
- A heuristic algorithm to minimize total weighted tardiness on a single machine with release times
- Lower bounds for parallel machine scheduling problems
- Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods
This page was built for publication: Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3166272)
