A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
From MaRDI portal
Publication:941541
DOI10.1016/j.cor.2006.07.010zbMath1180.90133OpenAlexW2151289965WikidataQ57185793 ScholiaQ57185793MaRDI QIDQ941541
Rabia Nessah, Farouk Yalaoui, Chengbin Chu
Publication date: 1 September 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.07.010
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (13)
Practical solutions for a dock assignment problem with trailer transportation ⋮ Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function ⋮ An exact extended formulation for the unrelated parallel machine total weighted completion time problem ⋮ Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time ⋮ On the exact solution of a large class of parallel machine scheduling problems ⋮ A makespan minimization problem for versatile developers in the game industry ⋮ A global constraint for total weighted completion time for unary resources ⋮ Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods ⋮ Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates ⋮ A new approximation algorithm for unrelated parallel machine scheduling with release dates ⋮ A new Lagrangian Relaxation Algorithm for scheduling dissimilar parallel machines with release dates ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ Iterated greedy algorithms for a complex parallel machine scheduling problem
Cites Work
- Unnamed Item
- Unnamed Item
- Scheduling-LPs bear probabilities. Randomized approximations for min-sum criteria
- Weighted flow time bounds for scheduling identical processors
- Scheduling with release dates on a single machine to minimize total weighted completion time
- A new dynamic programming algorithm for the parallel machines total weighted completion time problem
- A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems
- Scheduling identical parallel machines to minimize total weighted completion time
- Scheduling equal-length jobs on identical parallel machines
- On the minimization of total weighted flow time with identical and uniform parallel machines
- An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime
- New Bounds for the Identical Parallel Processor Weighted Flow Time Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Solving Parallel Machine Scheduling Problems by Column Generation
- Scheduling independent tasks to reduce mean finishing time
- Scheduling jobs that arrive over time
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Technical Note—Minimizing Average Flow Time with Parallel Machines
This page was built for publication: A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
