JOB-SHOP SCHEDULING UNDER A NONRENEWABLE RESOURCE CONSTRAINT
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, cilt.45, sa.8, ss.942-947, 1994 (SSCI, Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 45 Sayı: 8
- Basım Tarihi: 1994
- Doi Numarası: 10.2307/2584018
- Dergi Adı: JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
- Derginin Tarandığı İndeksler: Social Sciences Citation Index (SSCI), Scopus
- Sayfa Sayıları: ss.942-947
- Orta Doğu Teknik Üniversitesi Adresli: Hayır
Özet
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.