Györgyi, Péter and Kis, Tamás and Tamási, Tímea and Békési, József (2023) Joint replenishment meets scheduling. JOURNAL OF SCHEDULING, 26. pp. 77-94. ISSN 1094-6136 10.1007/s10951-022-00768-0

Preview

Text Gyorgyi_77_33370872_ny.pdf Download (618kB) | Preview

Abstract

In this paper, we consider a combination of the joint replenishment problem (JRP) and single-machine scheduling with release dates. There is a single machine and one or more item types. Each job has a release date, a positive processing time, and it requires a subset of items. A job can be started at time t only if all the required item types were replenished between the release date of the job and time point t . The ordering of item types for distinct jobs can be combined. The objective is to minimize the total ordering cost plus a scheduling criterion, such as total weighted completion time or maximum flow time, where the cost of ordering a subset of items simultaneously is the sum of a joint ordering cost, and an additional item ordering cost for each item type in the subset. We provide several complexity results for the offline problem, and competitive analysis for online variants with min–sum and min–max criteria, respectively.

Item Type:	Article
Subjects:	Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions:	Research Laboratory on Engineering & Management Intelligence
SWORD Depositor:	MTMT Injector
Depositing User:	MTMT Injector
Date Deposited:	28 Feb 2023 12:27
Last Modified:	11 Sep 2023 15:00
URI:	https://eprints.sztaki.hu/id/eprint/10503

Update Item