A Batch Scheduling Problem with Two Agents

Byung-Cheon Choi () and Myoung-Ju Park
Additional contact information
Byung-Cheon Choi: Department of Business Administration, Chungnam National University, 79 Daehangno, Yuseong-gu, Daejeon 305-704, Korea
Myoung-Ju Park: Department of Industrial and Management Systems Engineering, Kyung Hee University, 1732, Deogyeong-daero, Giheung-gu, Yongin-si, Kyunggi-do 446-701, Korea

Asia-Pacific Journal of Operational Research (APJOR), 2015, vol. 32, issue 06, 1-19

Abstract: In this paper, we consider a two-agent batch scheduling problem on a single machine such that the processing times of agent 1 and the due date of agent 2 in the same batch are identical. The objective is to minimize the total completion time of agent 1 with a constraint on the maximum tardiness of agent 2. First, we propose the optimality conditions. Then, we show that the problem is strongly NP-hard. Finally, we prove the problem remains NP-hard even for the case with one batch of agent 2, and develop a pseudo-polynomial algorithm and an approximation algorithm for this case.

Keywords: Scheduling; batch scheduling; multi-agent sequencing (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S021759591550044X
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:apjorx:v:32:y:2015:i:06:n:s021759591550044x

Ordering information: This journal article can be ordered from

DOI: 10.1142/S021759591550044X

Access Statistics for this article

Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao

More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().