A new approximation algorithm for unrelated parallel machine scheduling with release dates (Q2289003): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 20:26, 17 December 2024

scientific article

Language	Label	Description	Also known as
English	A new approximation algorithm for unrelated parallel machine scheduling with release dates	scientific article

Statements

scholarly article

0 references

A new approximation algorithm for unrelated parallel machine scheduling with release dates (English)

0 references

0 references

0 references

0 references

Annals of Operations Research

0 references

publication date

20 January 2020

0 references

zbMATH Keywords

unrelated parallel machine scheduling

0 references

release dates

0 references

semi-definite programming

0 references

approximation algorithm

0 references

branch-and-bound

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10479-019-03346-4

0 references

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

0 references

CSDP, A C library for semidefinite programming

0 references

An exact extended formulation for the unrelated parallel machine total weighted completion time problem

0 references

Solving Parallel Machine Scheduling Problems by Column Generation

0 references

An analysis of heuristics for the parallel-machine flexible-resource scheduling problem

0 references

On modelling the maximum workload allocation for parallel unrelated machines with setups

0 references

A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan

0 references

Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms

0 references

0 references

Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates

0 references

Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan

0 references

Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem

0 references

0 references

Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms

0 references

Cones of Matrices and Set-Functions and 0–1 Optimization

0 references

Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem

0 references

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

0 references

Task Scheduling in Networks

0 references

Semidefinite relaxations for partitioning, assignment and ordering problems

0 references

GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times

0 references

An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem

0 references

Scheduling Unrelated Machines by Randomized Rounding

0 references

A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems

0 references

Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion

0 references

A \((2 + \epsilon)\)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective

0 references

Convex quadratic and semidefinite programming relaxations in scheduling

0 references

A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective

0 references

Unrelated Machine Scheduling with Stochastic Processing Times

0 references

A new Lagrangian Relaxation Algorithm for scheduling dissimilar parallel machines with release dates

0 references

Parallel Machine Scheduling by Column Generation

0 references

Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines

0 references

Approximate algorithms for unrelated machine scheduling to minimize makespan

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

10.1007/S10479-019-03346-4

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2289003

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2289003&oldid=38989962"