Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods
From MaRDI portal
Publication:2430608
DOI10.1007/s10479-010-0752-8zbMath1209.90182OpenAlexW2080029023WikidataQ57185730 ScholiaQ57185730MaRDI QIDQ2430608
Publication date: 8 April 2011
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-010-0752-8
Related Items
Cites Work
- Unnamed Item
- A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
- 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
- Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling 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
- Solving Parallel Machine Scheduling Problems by Column Generation
- Scheduling independent tasks to reduce mean finishing time
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Technical Note—Minimizing Average Flow Time with Parallel Machines
