SCHEDULING UNDER A NONRENEWABLE RESOURCE CONSTRAINT

TOKER A., KONDAKCI S., ERKIP N.

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, cilt.42, sa.9, ss.811-814, 1991 (SSCI) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 42 Sayı: 9
  • Basım Tarihi: 1991
  • Doi Numarası: 10.1057/jors.1991.152
  • Dergi Adı: JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
  • Derginin Tarandığı İndeksler: Social Sciences Citation Index (SSCI), Scopus
  • Sayfa Sayıları: ss.811-814
  • Anahtar Kelimeler: SCHEDULING, NONRENEWABLE RESOURCE
  • Orta Doğu Teknik Üniversitesi Adresli: Hayır

Özet

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.