Integrated scheduling of production and distribution with two competing agents

Bayi Cheng, Junwei Gao, Mi Zhou and Wei Chu

Journal of the Operational Research Society, 2024, vol. 75, issue 9, 1826-1836

Abstract: This paper studies a two-agent scheduling problem on a single batch machine. Each job j has a processing time pj and a size sj. Jobs should be delivered to the agent as soon as possible. The objective is to minimize the service span of the first agent subject to an upper bound on the makespan of the other agent. We propose two approximation algorithms when jobs have identical processing times and in the general case. Then we conduct theoretical analyses to provide the provable guarantees on the performances of the algorithms. Finally, we conduct simulation analyses based on randomly generated instances to evaluate the average performances of the algorithm in the general case.

Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/01605682.2023.2277867 (text/html)
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:taf:tjorxx:v:75:y:2024:i:9:p:1826-1836

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20

DOI: 10.1080/01605682.2023.2277867

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald

More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().