A Batch Scheduling Problem with Two Agents

DOI10.1142/S021759591550044XzbMath1335.90033OpenAlexW2184172003MaRDI QIDQ2788524

Myoung-Ju Park, Byung-Cheon Choi

Publication date: 19 February 2016

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

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

zbMATH Keywords

schedulingbatch schedulingmulti-agent sequencing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (3)

Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent ⋮ Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures ⋮ A just-in-time scheduling problem with two competing agents

Cites Work

• Single machine batch scheduling with two competing agents to minimize total flowtime
• Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
• Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
• Scheduling groups of unit length jobs on two identical parallel machines.
• Two-agent single-machine scheduling with assignable due dates
• A survey of scheduling problems with setup times or costs
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
• Principles of Sequencing and Scheduling
• Scheduling Problems with Two Competing Agents

This page was built for publication: A Batch Scheduling Problem with Two Agents