A Resource Allocation Problem with Convex Resource-Dependent Processing Times Under A Two-Machine Flow Shop Environment

Byung-Cheon Choi () and Jun-Ho Lee
Additional contact information
Byung-Cheon Choi: School of Business, Chungnam National University, 99 Daehak-ro, Yuseong-gu, Daejeon 34134, Korea
Jun-Ho Lee: School of Business, Chungnam National University, 99 Daehak-ro, Yuseong-gu, Daejeon 34134, Korea

Asia-Pacific Journal of Operational Research (APJOR), 2024, vol. 41, issue 02, 1-19

Abstract: We consider the resource allocation problem under a two-machine flow shop environment where the job sequence has been determined in advance. The resource is used to reduce the processing time that is inversely proportional to the resource consumption amount. Furthermore, there exist the lower and upper bounds on the amount of the resources consumed by each job. The objective is to minimize the makespan plus the total resource consumption cost. We show that the problem can be solved in strongly polynomial time.

Keywords: Resource allocation; two-machine flow shop; convex resource consumption function (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0217595923500185
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:41:y:2024:i:02:n:s0217595923500185

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0217595923500185

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