An Ordered Flow Shop with Two Agents

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

Asia-Pacific Journal of Operational Research (APJOR), 2016, vol. 33, issue 05, 1-24

Abstract: In this paper, we consider a two-agent scheduling problem in an m-machine ordered flow shop where each agent is responsible for his own set of jobs and wishes to minimize the makespan. Since the problem is NP-hard, we develop a pseudo-polynomial time approach for the case with a fixed number of machines and investigate the conditions that make the problem polynomially solvable. Finally, we consider a three-machine problem with a special processing time structure, and demonstrate its polynomiality.

Keywords: Scheduling; multi-agent sequencing; ordered flow shop (search for similar items in EconPapers)
Date: 2016
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/S0217595916500378
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:33:y:2016:i:05:n:s0217595916500378

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0217595916500378

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 ().