Minimizing L-max for the single machine scheduling problem with family set-ups

Schultz, SR; Hodgson, TJ; King, RE; Taner, Mehmet

doi:10.1080/00207540410001716561

Minimizing L-max for the single machine scheduling problem with family set-ups

Atıf İçin Kopyala

Schultz S., Hodgson T., King R., Taner M. R.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, cilt.42, sa.20, ss.4315-4330, 2004 (SCI-Expanded)

Yayın Türü: Makale / Tam Makale
Cilt numarası: 42 Sayı: 20
Basım Tarihi: 2004
Doi Numarası: 10.1080/00207540410001716561
Dergi Adı: INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
Sayfa Sayıları: ss.4315-4330
TED Üniversitesi Adresli: Hayır

Özet

A procedure for the single machine-scheduling problem of minimizing the maximum lateness for jobs with sequence independent set-ups is presented. The procedure provides optimal/near-optimal solutions over a wide range of problems. It performs well compared with other heuristics, and it is effective in finding solutions for large problems.