SCHEDULING UNDER A NONRENEWABLE RESOURCE CONSTRAINT

  • TOKER, A
  • KONDAKCI, S
  • ERKIP, N
ORKG logo View in ORKG
Publication date
September 1991
Publisher
Springer Science and Business Media LLC
Journal
Journal of the Operational Research Society

Abstract

This paper examines a single-machine, non-renewable-resource-constrained scheduling problem where jobs have arbitary processing times and resource requirements. Unit supply of a resource is assumed at each time period. Performance criterion is makespan. It is proved that this problem is identical to the two-machine flowshop problem, enabling the use of Johnson's algorithm. Immediate extensions of this result are presented

Extracted data

We use cookies to provide a better user experience.