Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures-Reference-Cited by-同舟云学术

Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures

Published:2017-08 Issue:04 Volume:34 Page:1750017
ISSN:0217-5959
Container-title:Asia-Pacific Journal of Operational Research
language:en
Short-container-title:Asia Pac. J. Oper. Res.

Author:

Kim Byung-Gyoo¹,Choi Byung-Cheon²,Park Myoung-Ju³

Affiliation:

1. Head of Global Solution, NH-Amundi Asset Management, 10F, 2 Gukjegeumyung-ro 8-gil, Yeongdeungpo-gu, Seoul 07330, Korea

2. Department of Business Administration, Chungnam National University, 99 Daehak-ro, Yuseong-gu, Daejeon 34134, Korea

3. Department of Industrial and Management Systems Engineering, Kyung Hee University, 1732, Deogyeong-daero, Giheung-gu, Yongin-si, Kyunggi-do 17104, Korea

Abstract

We consider a two-agent scheduling problem in a two-machine flow shop environment where each agent is responsible for his own set of jobs and wishes to minimize the makespan. The objective is to minimize one agent’s makespan, subject to the other’s objective of not exceeding a given threshold. It is known that the problem is NP-hard. Thus, we consider special cases such that the processing times of each agent have a special structure, and analyze their computational complexity.

Publisher

World Scientific Pub Co Pte Lt

Subject

Management Science and Operations Research,Management Science and Operations Research

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0217595917500178

Reference39 articles.

1. Multiagent Scheduling

2. Scheduling Problems with Two Competing Agents

3. Multi-agent single machine scheduling

4. Faster algorithms for the shortest path problem

5. A competitive scheduling problem and its relevance to UMTS channel assignment

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Two-agent scheduling in a two-machine open shop;Annals of Operations Research;2023-12-20

2. Impact of Problems Associated with Scheduling and Capacity Planning of a Production Process – An Overview;E3S Web of Conferences;2021

3. Minimizing the weighted sum of maximum earliness and maximum tardiness in a single-agent and two-agent form of a two-machine flow shop scheduling problem;Operational Research;2020-06-20

4. Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates;Asia-Pacific Journal of Operational Research;2020-01-17

5. Makespan minimization for the m-machine ordered flow shop scheduling problem;Computers & Operations Research;2019-11