Group Scheduling with Two Competing Agents on a Single Machine

DOI10.1142/S0217595914500432zbMath1307.90070MaRDI QIDQ5174413

Ren-Xia Chen, Shi-Sheng Li

Publication date: 17 February 2015

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

single-machinegroup technologyagent scheduling

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Single machine batch scheduling with two competing agents to minimize total flowtime
• Two-agent scheduling to minimize the total cost
• Scheduling two agents with controllable processing times
• Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
• Optimal due date assignment and resource allocation in a group technology scheduling environment
• 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 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
• Scheduling Problems with Two Competing Agents
• Scheduling Groups of Jobs on a Single Machine
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints

This page was built for publication: Group Scheduling with Two Competing Agents on a Single Machine