A new dynamic programming formulation of (n x m) flowshop sequencing problems with due dates

Sonmez A., Baykasoglu A.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, cilt.36, sa.8, ss.2269-2283, 1998 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 36 Sayı: 8
  • Basım Tarihi: 1998
  • Doi Numarası: 10.1080/002075498192896
  • Dergi Adı: INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.2269-2283
  • Dokuz Eylül Üniversitesi Adresli: Hayır

Özet

A dynamic programming formulation is presented for determining an optimal solution to a problem where n jobs are to be sequenced in a multi-stage production environment. An application of a developed formulation to a plastic pipe manufacturing factory is also presented. Conditions are such that the job sequence is the same in all stages, each job requires setups at each stage and setup times are sequence dependent. An optimal solution is such that the minimum total tardiness is achieved. A listing of the developed computer program is also provided.