Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds (Q4645931): Difference between revisions

Latest revision as of 19:57, 17 July 2024

scientific article; zbMATH DE number 7000357

Language	Label	Description	Also known as
English	Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds	scientific article; zbMATH DE number 7000357

Statements

instance of

scholarly article

0 references

title

Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds (English)

0 references

author

Andreas S. Schulz

0 references

published in

Integer Programming and Combinatorial Optimization

0 references

publication date

11 January 2019

0 references

zbMATH Keywords

approximation algorithm

0 references

completion time

0 references

parallel machine

0 references

single machine

0 references

flow shop

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/3-540-61310-2_23

0 references

cites work

Scheduling independent tasks to reduce mean finishing time

0 references

Q4818873

0 references

Formulating the single machine sequencing problem with release dates as a mixed integer program

0 references

The Complexity of Flowshop and Jobshop Scheduling

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Geometric algorithms and combinatorial optimization

0 references

A supermodular relaxation for scheduling with release dates

0 references

Flowshop and Jobshop Schedules: Complexity and Approximation

0 references

Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop

0 references

A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach

0 references

Q4875178

0 references

Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem

0 references

Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints

0 references

Q3995531

0 references

Q4124328

0 references

Approximation algorithms for scheduling unrelated parallel machines

0 references

Scheduling jobs with communication delays: Using infeasible solutions for approximation

0 references

Scheduling jobs that arrive over time

0 references

Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds

0 references

Structure of a simple scheduling polyhedron

0 references

A multi-stage parallel-processor flowshop problem with minimum flowtime

0 references

Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds

0 references

An approximation algorithm for the generalized assignment problem

0 references

Identifiers

zbMATH Open document ID

1414.90167

0 references

DOI

10.1007/3-540-61310-2_23

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4645931

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-61310-2_23
+Normal rank
@@ Property / OpenAlex ID @@
+W1960330418
@@ Property / OpenAlex ID: W1960330418 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling independent tasks to reduce mean finishing time
+Normal rank
@@ Property / cites work @@
+Q4818873
@@ Property / cites work: Q4818873 / rank @@
+Normal rank
@@ Property / cites work @@
+Formulating the single machine sequencing problem with release dates as a mixed integer program
+Normal rank
@@ Property / cites work @@
+The Complexity of Flowshop and Jobshop Scheduling
@@ Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+A supermodular relaxation for scheduling with release dates
+Normal rank
@@ Property / cites work @@
+Flowshop and Jobshop Schedules: Complexity and Approximation
+Normal rank
@@ Property / cites work @@
+Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop
+Normal rank
@@ Property / cites work @@
+A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
+Normal rank
@@ Property / cites work @@
+Q4875178
@@ Property / cites work: Q4875178 / rank @@
+Normal rank
@@ Property / cites work @@
+Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
+Normal rank
@@ Property / cites work @@
+Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
+Normal rank
@@ Property / cites work @@
+Q3995531
@@ Property / cites work: Q3995531 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4124328
@@ Property / cites work: Q4124328 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for scheduling unrelated parallel machines
+Normal rank
@@ Property / cites work @@
+Scheduling jobs with communication delays: Using infeasible solutions for approximation
+Normal rank
@@ Property / cites work @@
+Scheduling jobs that arrive over time
@@ Property / cites work: Scheduling jobs that arrive over time / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds
+Normal rank
@@ Property / cites work @@
+Structure of a simple scheduling polyhedron
@@ Property / cites work: Structure of a simple scheduling polyhedron / rank @@
+Normal rank
@@ Property / cites work @@
+A multi-stage parallel-processor flowshop problem with minimum flowtime
+Normal rank
@@ Property / cites work @@
+Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for the generalized assignment problem
+Normal rank