Scheduling two job families on a single machine with two competitive agents
From MaRDI portal
(Redirected from Publication:326478)
Recommendations
- Single machine family scheduling with two competing agents to minimize makespan
- Group Scheduling with Two Competing Agents on a Single Machine
- Scheduling Problems with Two Competing Agents
- Unbounded parallel-batching scheduling with two competitive agents
- Competitive two-agent scheduling and its applications
Cites work
- scientific article; zbMATH DE number 3550186 (Why is no real title available?)
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- 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 the complexity of the problem of two-agent scheduling on a single machine
- A note on the scheduling with two families of jobs
- A survey of scheduling problems with setup times or costs
- Batch scheduling to minimize maximum lateness
- Batch scheduling to minimize total completion time
- Bounded parallel-batching scheduling with two competing agents
- Competitive two-agent scheduling and its applications
- Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
- Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- 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
- Multi-agent single machine scheduling
- Multiagent scheduling. Models and algorithms
- On games corresponding to sequencing situations with ready times
- On the Complexity of Scheduling with Batch Setup Times
- Scheduling Problems with Two Competing Agents
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Scheduling two agents with controllable processing times
- Scheduling with batching: A review
- Scheduling with families of jobs and delivery coordination under job availability
- Single machine batch scheduling with two competing agents to minimize total flowtime
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine
- Unbounded parallel-batching scheduling with two competitive agents
Cited in
(11)- Online single-machine scheduling to minimize the linear combination of makespans of two agents
- Scheduling two competing agents when one agent has significantly fewer jobs
- A note on the single machine competitive scheduling problem with two-agent \(1\|\sum w^A_jc^A_j: f^B_{\max}\leq Q\)
- Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
- Serial-batching scheduling with two agents to minimize makespan and maximum cost
- Single machine family scheduling with two competing agents to minimize makespan
- Single machine scheduling with two competing agents and equal job processing times
- Two-Agent Scheduling with Resource Augmentation on Multiple Machines
- Group Scheduling with Two Competing Agents on a Single Machine
- Multitasking scheduling problems with two competitive agents
- Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs
This page was built for publication: Scheduling two job families on a single machine with two competitive agents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326478)
