Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
DOI10.1051/RO/2012010zbMATH Open1248.90049OpenAlexW2169933753MaRDI QIDQ3166272FDOQ3166272
Mohamed Haouari, Nizar Souayah, Imed Kacem
Publication date: 10 October 2012
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=RO_2012__46_2_125_0/
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
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)
Cites Work
- Scheduling jobs on parallel machines with sequence-dependent setup times
- Scheduling parallel machines to minimize total weighted and unweighted tardiness
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- Scheduling on parallel identical machines to minimize total tardiness
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimizing total tardiness on a single machine with unequal release dates
- Scheduling a single machine to minimize a regular objective function under setup constraints
- On the single machine total tardiness problem
- Conjugate gradient methods using quasi-Newton updates with inexact line searches
- Lower bounds for parallel machine scheduling problems
- Reducing total tardiness cost in manufacturing cell scheduling by a multi-factor priority rule
Cited In (17)
- 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
- 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
- Title not available (Why is that?)
- 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
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF
- 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 heuristic algorithm to minimize total weighted tardiness on a single machine with release times
- A branch and bound algorithm to minimize total weighted tardiness on a single processor
- Lower bounds for parallel machine scheduling problems
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)
