Scheduling two job families on a single machine with two competitive agents

DOI10.1007/S10878-015-9902-XzbMATH Open1353.90065OpenAlexW425079745MaRDI QIDQ326478FDOQ326478

Authors: Shisheng Li, Ren-Xia Chen, Qi Feng 

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

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

zbMATH Keywords

algorithmsingle-machinejob familytwo-agent scheduling

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Scheduling with batching: A review
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
• 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
• Competitive two-agent scheduling and its applications
• Scheduling Problems with Two Competing Agents
• Single machine batch scheduling with two competing agents to minimize total flowtime
• Multiagent scheduling. Models and algorithms
• A note on the scheduling with two families of jobs
• A Lagrangian approach to single-machine scheduling problems with two competing agents
• Unbounded parallel-batching scheduling with two competitive agents
• Bounded parallel-batching scheduling with two competing agents
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
• Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
• On the Complexity of Scheduling with Batch Setup Times
• Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
• A note on the complexity of the problem of two-agent scheduling on a single machine
• Title not available (Why is that?)
• 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
• On games corresponding to sequencing situations with ready times
• A competitive scheduling problem and its relevance to UMTS channel assignment
• Two-agent scheduling with agent specific batches on an unbounded serial batching machine
• Scheduling two agents with controllable processing times

Cited In (11)

• Single machine scheduling with two competing agents and equal job processing times
• Serial-batching scheduling with two agents to minimize makespan and maximum cost
• Two-Agent Scheduling with Resource Augmentation on Multiple Machines
• 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
• 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
• Group Scheduling with Two Competing Agents on a Single Machine
• Multitasking scheduling problems with two competitive agents
• A note on the single machine competitive scheduling problem with two-agent \(1\|\sum w^A_jc^A_j: f^B_{\max}\leq Q\)
• Single machine family scheduling with two competing agents to minimize makespan

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)