Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time
From MaRDI portal
Publication:2098029
Recommendations
- Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits
- Fast approximation algorithms for bi-criteria scheduling with machine assignment costs
- Faster algorithms for bicriteria scheduling of identical jobs on uniform machines
- Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines
- Approximation results for a bicriteria job scheduling problem on a single machine without preemption
Cites work
- A bicriteria approximation algorithm for the \(k\)-center and \(k\)-median problems
- A DP algorithm for minimizing makespan and total completion time on a series-batching machine
- Algorithms minimizing mean flow time: Schedule-length properties
- Approximation techniques for average completion time scheduling
- Balancing minimum spanning trees and shortest-path trees
- Bicriteria approximation algorithms for scheduling problems with communications delays
- Bicriteria optimisation of the makespan and mean flowtime on two identical parallel machines
- Bounds on Multiprocessing Timing Anomalies
- Competitive two-agent scheduling and its applications
- Fast approximation algorithms for bi-criteria scheduling with machine assignment costs
- Heuristics for scheduling in flowshop with multiple objectives
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 1305482 (Why is no real title available?)
- scientific article; zbMATH DE number 1305545 (Why is no real title available?)
- scientific article; zbMATH DE number 2102785 (Why is no real title available?)
- scientific article; zbMATH DE number 2119733 (Why is no real title available?)
- Ideal schedules in parallel machine settings
- Improved approximation algorithms for (budgeted) node-weighted Steiner problems
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
- Multicriteria scheduling
- Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
- On the existence of schedules that are near-optimal for both makespan and total weighted completion time
- On the Minimization of the Makespan Subject to Flowtime Optimality
- Optimal scheduling for two-processor systems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling independent tasks to reduce mean finishing time
- Scheduling Problems with Two Competing Agents
- Scheduling unit processing time jobs on a single machine with multiple criteria
- Total completion time minimization on multiple machines subject to machine availability and makespan constraints
- Two-machine flowshop scheduling with a secondary criterion
Cited in
(7)- Faster algorithms for bicriteria scheduling of identical jobs on uniform machines
- scientific article; zbMATH DE number 2221458 (Why is no real title available?)
- Approximation algorithms for coupled task scheduling minimizing the sum of completion times
- Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits
- Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing
- Minimizing total completion time and makespan for a multi-scenario bi-criteria parallel machine scheduling problem
- Approximating multi-scenario efficient solutions for an uncertain bi-criteria parallel machine scheduling problem
This page was built for publication: Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2098029)
