Optimal algorithms for preemptive two-agent scheduling on uniform parallel machines
From MaRDI portal
Cites work
- A Level Algorithm for Preemptive Scheduling
- A multiple-criterion model for machine scheduling
- A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
- An approximation algorithm for multi-agent scheduling on two uniform parallel machines
- Bicriteria scheduling of equal length jobs on uniform parallel machines
- Competitive two-agent scheduling and its applications
- Competitive two-agent scheduling with release dates and preemption on a single machine
- Multi-agent scheduling on a single machine with max-form criteria
- Multiagent scheduling. Models and algorithms
- Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
- Scheduling Problems with Two Competing Agents
- Scheduling two agents on uniform parallel machines with~makespan and cost functions
- Scheduling with release dates and preemption to minimize multiple max-form objective functions
- Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
- Two-agent scheduling on uniform parallel machines with min-max criteria
- Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness
Cited in
(2)
This page was built for publication: Optimal algorithms for preemptive two-agent scheduling on uniform parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6593671)
