Joint replenishment meets scheduling

József Békési, Péter Györgyi, Tamás Kis


In this paper we consider a combination of the joint replenishment problem and a single machine scheduling problem with release dates. There is a single machine and one or more additional, non-renewable resources. Each job has a release date, a positive processing time, and some resource requirements. A job can be started at time $t$ only if there occurred a replenishment of all the required resources between the release date of the job and time point $t$. The objective is to minimize the total replenishment cost plus the total weighted completion time of the jobs, where each replenishment from each resource incurs a fixed cost, and there is an additional fixed cost each time some resource is replenished. We provide several complexity results and competitive analysis for online variants of the problem.

Bibtex entry:

AUTHOR = {B{\'e}k{\'e}si, J{\'o}zsef and Györgyi, P{\'e}ter and Kis, Tam{\'a}s},
TITLE = {Joint replenishment meets scheduling},
NOTE= {{\tt}},
INSTITUTION = {Egerv{\'a}ry Research Group, Budapest},
YEAR = {2020},
NUMBER = {TR-2020-20}

Last modification: 29.12.2020. Please email your comments to Tamás Király!