Satisfying due-dates in large multi-factory supply chains
IIE TRANSACTIONS, cilt.34, sa.9, ss.803-811, 2002 (SCI-Expanded)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 34 Sayı: 9
- Basım Tarihi: 2002
- Doi Numarası: 10.1023/a:1015500822105
- Dergi Adı: IIE TRANSACTIONS
- Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED)
- Sayfa Sayıları: ss.803-811
- TED Üniversitesi Adresli: Hayır
Özet
A procedure is developed for the simultaneous scheduling of multi-factory supply chains, including inter-factory transportation. A job-shop scheduling procedure, known to provide near-optimal solutions to industrial-sized problems, is enhanced to include transportation elements in the fundamental model. In order to demonstrate the quality of the solutions, a lower bound calculation is compared to the procedure's solutions on a number of large-scale test problems. The lower bound is an enhancement of the classic lower bound calculation for the N-job, M-machine job shop. The computational effort in scheduling is linear in the size of the problem, and high quality solutions to large-scale problems can be obtained in seconds.