Technical Note
Journal of the Operational Research Society (1994) 45, 942–947. doi:10.1057/jors.1994.146
Job Shop Scheduling under a Non-Renewable Resource Constraint
Aysegül Toker, Suna Kondakci and Nesim Erkip
Middle East Technical University, Turkey
Correspondence: A. Toker, Industrial Engineering Department, Middlle East Technical University, Ankara 06531, Turkey
Top of page
Abstract
In this paper we consider the job shop scheduling problem under a discrete non-renewable resource constraint. We assume that jobs have arbitrary processing times and resource requirements and there is a unit supply of the resource at each time period. We develop an approximation algorithm for this problem and empirically test its effectiveness in finding the minimum makespan schedules.
Keywords:
Approximation Algorithm, Job Shop Scheduling, Non-Renewable Resource
