Group Scheduling with Two Competing Agents on a Single Machine

DOI10.1142/S0217595914500432MaRDI QIDQ5174413zbMATH OpenFDO

Authors Ren-Xia Chen, Shisheng Li

Publication date 17 February 2015

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

Full work available at URL https://doi.org/10.1142/S0217595914500432

zbMATH Keywords

agent schedulinggroup technologysingle-machine

Mathematics Subject Classification ID

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

Recommendations

• Scheduling two job families on a single machine with two competitive agents
• Single machine scheduling with two competing agents and equal job processing times
• Scheduling Problems with Two Competing Agents
• Multitasking scheduling problems with two competitive agents
• Two-agent scheduling on a single sequential and compatible batching machine
• Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
• Scheduling two competing agents when one agent has significantly fewer jobs
• Single machine batch scheduling with two competing agents to minimize total flowtime
• Competitive two-agent scheduling and its applications

Cites work

• A multiple-criterion model for machine scheduling
• A note on the complexity of the problem of two-agent scheduling on a single machine
• A survey of scheduling problems with setup times or costs
• Bounded parallel-batching scheduling with two competing agents
• Competitive two-agent scheduling and its applications
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
• Multi-agent single machine scheduling
• Optimal due date assignment and resource allocation in a group technology scheduling environment
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Scheduling Groups of Jobs on a Single Machine
• 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
• Single machine batch scheduling with two competing agents to minimize total flowtime
• Two-agent scheduling to minimize the total cost
• Unbounded parallel-batching scheduling with two competitive agents

Cited in

(4)

• Group scheduling on two cells with intercell movement
• Single machine family scheduling with two competing agents to minimize makespan
• Scheduling two job families on a single machine with two competitive agents
• Work-competitive scheduling for cooperative computing with dynamic groups

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5174413)