Batch sizing and just-in-time scheduling with common due date
ANNALS OF OPERATIONS RESEARCH, cilt.213, sa.1, ss.187-202, 2014 (SCI-Expanded, Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 213 Sayı: 1
- Basım Tarihi: 2014
- Doi Numarası: 10.1007/s10479-012-1289-9
- Dergi Adı: ANNALS OF OPERATIONS RESEARCH
- Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
- Sayfa Sayıları: ss.187-202
- Anahtar Kelimeler: Batch sizing, Scheduling, Single machine, Earliness, Tardiness, Common due-date, SUPPLY CHAIN, MACHINE, EARLINESS, JOBS
- TED Üniversitesi Adresli: Evet
Özet
In this paper, we address the optimal batch sizing and just-in-time scheduling problem where upper and lower bounds on the size of the batches are imposed. The objective is to find a feasible schedule that minimizes the sum of the weighted earliness and tardiness penalties as well as the setup costs, which involves the cost of creating a new batch. We present some structural properties of the optimal schedules and describe solving algorithms for the single machine problem.