A new approximation algorithm for unrelated parallel machine scheduling with release dates
From MaRDI portal
Publication:2289003
approximation algorithmbranch-and-boundrelease datessemi-definite programmingunrelated parallel machine scheduling
Quadratic programming (90C20) Convex programming (90C25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Semidefinite programming (90C22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Integer programming (90C10)
Recommendations
- A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines
- Approximate algorithms for unrelated machine scheduling to minimize makespan
- Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates
- Experimental comparison of approximation algorithms for scheduling unrelated parallel machines
- A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times
Cites work
- scientific article; zbMATH DE number 1187164 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
- A \((2 + \epsilon)\)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
- A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
- A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A new Lagrangian relaxation algorithm for scheduling dissimilar parallel machines with release dates
- An analysis of heuristics for the parallel-machine flexible-resource scheduling problem
- An exact extended formulation for the unrelated parallel machine total weighted completion time problem
- An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
- Approximate algorithms for unrelated machine scheduling to minimize makespan
- Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates
- CSDP, A C library for semidefinite programming
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Convex quadratic and semidefinite programming relaxations in scheduling
- Experimental comparison of approximation algorithms for scheduling unrelated parallel machines
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
- Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- On modelling the maximum workload allocation for parallel unrelated machines with setups
- On the minimization of total weighted flow time with identical and uniform parallel machines
- Parallel machine scheduling by column generation
- Scheduling Unrelated Machines by Randomized Rounding
- Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
- Solving Parallel Machine Scheduling Problems by Column Generation
- Task Scheduling in Networks
- Unrelated machine scheduling with stochastic processing times
- Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem
Cited in
(8)- Bicriteria scheduling problem for unrelated parallel machines with release dates
- A makespan minimization problem for versatile developers in the game industry
- A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times
- Exact and approximate methods for parallel multiple-area spatial scheduling with release times
- Iterated greedy algorithms for a complex parallel machine scheduling problem
- scientific article; zbMATH DE number 1757946 (Why is no real title available?)
- A variable neighborhood search algorithm for uniform parallel machine scheduling with release dates
- Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates
This page was built for publication: A new approximation algorithm for unrelated parallel machine scheduling with release dates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289003)
