Scheduling two job families on a single machine with two competitive agents
From MaRDI portal
Publication:326478
DOI10.1007/S10878-015-9902-XzbMath1353.90065OpenAlexW425079745MaRDI QIDQ326478
Qi Feng, Ren-Xia Chen, Shi-Sheng Li
Publication date: 12 October 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9902-x
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs ⋮ 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 ⋮ Two-Agent Scheduling with Resource Augmentation on Multiple Machines
Cites Work
- Unnamed Item
- Single machine batch scheduling with two competing agents to minimize total flowtime
- A note on the scheduling with two families of jobs
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine
- Scheduling two agents with controllable processing times
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Scheduling with families of jobs and delivery coordination under job availability
- Batch scheduling to minimize maximum lateness
- Batch scheduling to minimize total completion time
- Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
- On games corresponding to sequencing situations with ready times
- Scheduling with batching: A review
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- A note on the complexity of the problem of two-agent scheduling on a single machine
- Unbounded parallel-batching scheduling with two competitive agents
- Bounded parallel-batching scheduling with two competing agents
- A multiple-criterion model for machine scheduling
- A survey of scheduling problems with setup times or costs
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Competitive Two-Agent Scheduling and Its Applications
- A competitive scheduling problem and its relevance to UMTS channel assignment
- Scheduling Problems with Two Competing Agents
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
- On the Complexity of Scheduling with Batch Setup Times
- Multiagent Scheduling
This page was built for publication: Scheduling two job families on a single machine with two competitive agents
