SINGLE MACHINE FAMILY SCHEDULING WITH TWO COMPETING AGENTS TO MINIMIZE MAKESPAN

DOI10.1142/S021759591100334XzbMath1232.90207MaRDI QIDQ3114615

Shijie Sun, Guosheng Ding

Publication date: 19 February 2012

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

zbMATH Keywords

family schedulingsetupmulti-agent deterministic sequencing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems

Cites Work

• Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
• Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
• Scheduling with batching: A review
• 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
• 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
• Scheduling Problems with Two Competing Agents
• Survey of scheduling research involving setup times

This page was built for publication: SINGLE MACHINE FAMILY SCHEDULING WITH TWO COMPETING AGENTS TO MINIMIZE MAKESPAN