One machine scheduling to minimize the maximum earliness with minimum number of tardy jobs

Guner, E; Erol, SERPİL; Tani, K

doi:10.1016/s0925-5273(98)00062-0

One machine scheduling to minimize the maximum earliness with minimum number of tardy jobs

Atıf İçin Kopyala

Guner E., Erol S., Tani K.

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, cilt.55, sa.2, ss.213-219, 1998 (SCI-Expanded)

Yayın Türü: Makale / Tam Makale
Cilt numarası: 55 Sayı: 2
Basım Tarihi: 1998
Doi Numarası: 10.1016/s0925-5273(98)00062-0
Dergi Adı: INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
Sayfa Sayıları: ss.213-219
Gazi Üniversitesi Adresli: Evet

Özet

In this study we consider the problem of sequencing n jobs on one machine under the dual objective of minimizing the maximum earliness (E-max) with minimum number of tardy jobs (n(T)). A procedure is first proposed to schedule for minimizing the maximum earliness when the set of non-tardy jobs is specified. A branch and bound algorithm is presented to obtain the optimal schedule that minimizes the maximum earliness with minimum number of tardy jobs by connecting Moore's algorithm. (C) 1998 Elsevier Science B.V. All rights reserved.