A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
From MaRDI portal
(Redirected from Publication:941541)
Recommendations
- Scheduling identical parallel machines to minimize total weighted completion time
- Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
- Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
- On the minimization of total weighted flow time with identical and uniform parallel machines
- Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time
Cites work
- scientific article; zbMATH DE number 40477 (Why is no real title available?)
- scientific article; zbMATH DE number 3471786 (Why is no real title available?)
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- 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
- 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
- On the minimization of total weighted flow time with identical and uniform parallel machines
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling equal-length jobs on identical parallel machines
- Scheduling identical parallel machines to minimize total weighted completion time
- Scheduling independent tasks to reduce mean finishing time
- Scheduling jobs that arrive over time
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Scheduling with release dates on a single machine to minimize total weighted completion time
- Scheduling-LPs bear probabilities. Randomized approximations for min-sum criteria
- Solving Parallel Machine Scheduling Problems by Column Generation
- Technical Note—Minimizing Average Flow Time with Parallel Machines
- Weighted flow time bounds for scheduling identical processors
Cited in
(28)- An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime
- A new approximation algorithm for unrelated parallel machine scheduling with release dates
- An exact extended formulation for the unrelated parallel machine total weighted completion time problem
- Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs
- On the exact solution of a large class of parallel machine scheduling problems
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- Scheduling of a single machine to minimize total weighted completion time subject to release dates
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan
- Scheduling with release dates on a single machine to minimize total weighted completion time
- 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
- A makespan minimization problem for versatile developers in the game industry
- A global constraint for total weighted completion time for unary resources
- scientific article; zbMATH DE number 91757 (Why is no real title available?)
- Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates
- A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
- Scheduling identical parallel machines to minimize total weighted completion time
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- Minimizing makespan on parallel machines subject to release dates and delivery times
- Iterated greedy algorithms for a complex parallel machine scheduling problem
- Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time
- Lower bounds for parallel machine scheduling problems
- A new Lagrangian relaxation algorithm for scheduling dissimilar parallel machines with release dates
- Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
- Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods
- A branch and bound algorithm to minimize completion time variance on a single processor.
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q941541)
