A new approximation algorithm for unrelated parallel machine scheduling with release dates
DOI10.1007/S10479-019-03346-4zbMATH Open1429.90028OpenAlexW2966192810WikidataQ127435289 ScholiaQ127435289MaRDI QIDQ2289003FDOQ2289003
Authors: Zhi Pei, Mingzhong Wan, Ziteng Wang 
Publication date: 20 January 2020
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-019-03346-4
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
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)
Cites Work
- CSDP, A C library for semidefinite programming
- Convex quadratic and semidefinite programming relaxations in scheduling
- Title not available (Why is that?)
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- An analysis of heuristics for the parallel-machine flexible-resource scheduling problem
- On the minimization of total weighted flow time with identical and uniform parallel machines
- Task Scheduling in Networks
- Solving Parallel Machine Scheduling Problems by Column Generation
- A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
- Parallel machine scheduling by column generation
- Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
- Experimental comparison of approximation algorithms for scheduling unrelated parallel machines
- An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
- Scheduling Unrelated Machines by Randomized Rounding
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan
- A new Lagrangian relaxation algorithm for scheduling dissimilar parallel machines with release dates
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
- Title not available (Why is that?)
- On modelling the maximum workload allocation for parallel unrelated machines with setups
- Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Approximate algorithms for unrelated machine scheduling to minimize makespan
- Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem
- An exact extended formulation for the unrelated parallel machine total weighted completion time problem
- A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
- A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
- Unrelated machine scheduling with stochastic processing times
- A \((2 + \epsilon)\)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
Cited In (7)
- A makespan minimization problem for versatile developers in the game industry
- Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates
- Bicriteria scheduling problem for unrelated parallel machines with release dates
- Exact and approximate methods for parallel multiple-area spatial scheduling with release times
- Title not available (Why is that?)
- A variable neighborhood search algorithm for uniform parallel machine scheduling with release dates
- Iterated greedy algorithms for a complex parallel machine scheduling problem
Uses Software
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)
