Two-agent single-machine scheduling with release dates to minimize the makespan
From MaRDI portal
Recommendations
- Two-agent scheduling on a single machine with release dates
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
- A two-agent single-machine scheduling problem to minimize the total cost with release dates
- Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
Cites work
- A comment on scheduling two parallel machines with capacity constraints
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- A competitive scheduling problem and its relevance to UMTS channel assignment
- A multiple-criterion model for machine scheduling
- A note on competing-agent Pareto-scheduling
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
- Approximation schemes for two-machine flow shop scheduling with two agents
- Competitive two-agent scheduling and its applications
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- scientific article; zbMATH DE number 108110 (Why is no real title available?)
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- 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.
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Scheduling Problems with Two Competing Agents
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness
- Scheduling two agents with controllable processing times
- Single machine just‐in‐time scheduling problems with two competing agents
- Two-agent scheduling in a flowshop
- Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
- Two-agent scheduling on a single machine with release dates
- Two-agent scheduling on uniform parallel machines with min-max criteria
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- Two-agent scheduling to minimize the total cost
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
Cited in
(2)
This page was built for publication: Two-agent single-machine scheduling with release dates to minimize the makespan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6081603)
