AN EFFICIENT ALGORITHM FOR THE SINGLE-MACHINE TARDINESS PROBLEM

KONDAKCI, S; KIRCA, O; AZIZOGLU, MERAL

doi:10.1016/0925-5273(94)90026-4

AN EFFICIENT ALGORITHM FOR THE SINGLE-MACHINE TARDINESS PROBLEM

Atıf İçin Kopyala

KONDAKCI S., KIRCA O., AZIZOGLU M.

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

Yayın Türü: Makale / Tam Makale
Cilt numarası: 36 Sayı: 2
Basım Tarihi: 1994
Doi Numarası: 10.1016/0925-5273(94)90026-4
Dergi Adı: INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
Sayfa Sayıları: ss.213-219
Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

This study considers the problem of minimizing total tardiness on a single machine. A simple and efficient lower bound and several upper bounds are developed. A branch and bound procedure incorporating the bounds, precedence relations and dominance properties is proposed. An experiment is designed to test the efficiency of the bounds, precedence relations and the branch and bound procedure. Computational experience with problems up to 35 jobs is reported.