Back to Search
Start Over
Integrated scheduling of production and distribution with two competing agents.
- Source :
- Journal of the Operational Research Society; Sep2024, Vol. 75 Issue 9, p1826-1836, 11p
- Publication Year :
- 2024
-
Abstract
- This paper studies a two-agent scheduling problem on a single batch machine. Each job j has a processing time p<subscript>j</subscript> and a size s<subscript>j</subscript>. 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. [ABSTRACT FROM AUTHOR]
- Subjects :
- APPROXIMATION algorithms
PRODUCTION scheduling
SCHEDULING
ALGORITHMS
MACHINERY
Subjects
Details
- Language :
- English
- ISSN :
- 01605682
- Volume :
- 75
- Issue :
- 9
- Database :
- Complementary Index
- Journal :
- Journal of the Operational Research Society
- Publication Type :
- Academic Journal
- Accession number :
- 179170539
- Full Text :
- https://doi.org/10.1080/01605682.2023.2277867