Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods (Q2430608): Difference between revisions

Latest revision as of 23:34, 3 July 2024

scientific article

Language	Label	Description	Also known as
English	Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods	scientific article

Statements

instance of

scholarly article

0 references

title

Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods (English)

0 references

zbMATH Open document ID

1209.90182

0 references

DOI

10.1007/s10479-010-0752-8

0 references

0 references

0 references

Annals of Operations Research

0 references

publication date

8 April 2011

0 references

Mathematics Subject Classification ID

0 references

0 references

scheduling

0 references

parallel machines

0 references

total weighted completion time

0 references

lower bound

0 references

availability constraints

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10479-010-0752-8

0 references

0 references

0 references

On the minimization of total weighted flow time with identical and uniform parallel machines

0 references

Scheduling equal-length jobs on identical parallel machines

0 references

Scheduling identical parallel machines to minimize total weighted completion time

0 references

Scheduling with release dates on a single machine to minimize total weighted completion time

0 references

Scheduling independent tasks to reduce mean finishing time

0 references

Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem

0 references

Solving Parallel Machine Scheduling Problems by Column Generation

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Technical Note—Minimizing Average Flow Time with Parallel Machines

0 references

A Functional Equation and its Application to Resource Allocation and Sequencing Problems

0 references

A new dynamic programming algorithm for the parallel machines total weighted completion time problem

0 references

Q4124328

0 references

A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates

0 references

An improved branching scheme for the branch and bound procedure of scheduling<i>n</i>jobs on<i>m</i>parallel machines to minimize total weighted flowtime

0 references

New Bounds for the Identical Parallel Processor Weighted Flow Time Problem

0 references

A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems

0 references

Weighted flow time bounds for scheduling identical processors

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2430608

@@ Property / cites work @@
+On the minimization of total weighted flow time with identical and uniform parallel machines
+Normal rank
@@ Property / cites work @@
+Scheduling equal-length jobs on identical parallel machines
+Normal rank
@@ Property / cites work @@
+Scheduling identical parallel machines to minimize total weighted completion time
+Normal rank
@@ Property / cites work @@
+Scheduling with release dates on a single machine to minimize total weighted completion time
+Normal rank
@@ Property / cites work @@
+Scheduling independent tasks to reduce mean finishing time
+Normal rank
@@ Property / cites work @@
+Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
+Normal rank
@@ Property / cites work @@
+Solving Parallel Machine Scheduling Problems by Column Generation
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Technical Note—Minimizing Average Flow Time with Parallel Machines
+Normal rank
@@ Property / cites work @@
+A Functional Equation and its Application to Resource Allocation and Sequencing Problems
+Normal rank
@@ Property / cites work @@
+A new dynamic programming algorithm for the parallel machines total weighted completion time problem
+Normal rank
@@ Property / cites work @@
+Q4124328
@@ Property / cites work: Q4124328 / rank @@
+Normal rank
@@ Property / cites work @@
+A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
+Normal rank
@@ Property / cites work @@
+An improved branching scheme for the branch and bound procedure of scheduling<i>n</i>jobs on<i>m</i>parallel machines to minimize total weighted flowtime
+Normal rank
@@ Property / cites work @@
+New Bounds for the Identical Parallel Processor Weighted Flow Time Problem
+Normal rank
@@ Property / cites work @@
+A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems
+Normal rank
@@ Property / cites work @@
+Weighted flow time bounds for scheduling identical processors
+Normal rank