Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times

Ozguven C., YAVUZ Y., ÖZBAKIR L.

Applied Mathematical Modelling, cilt.36, sa.2, ss.846-858, 2012 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 36 Sayı: 2
  • Basım Tarihi: 2012
  • Doi Numarası: 10.1016/j.apm.2011.07.037
  • Dergi Adı: Applied Mathematical Modelling
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.846-858
  • Anahtar Kelimeler: Mixed integer programming, Flexible job shop, Process plan flexibility, Sequence dependent setup, TABU-SEARCH, GENETIC ALGORITHM, INTEGRATION, FLEXIBILITY
  • Erciyes Üniversitesi Adresli: Evet

Özet

The optimization problem addressed in this paper is an advanced form of the flexible job shop scheduling problem (FJSP) which also covers process plan flexibility and separable/non-separable sequence dependent setup times in addition to routing flexibility. Upon transforming the problem into an equivalent network problem, two mixed integer goal programming models are formulated. In the first model (Model A) the sequence dependent setup times are non-separable. In the second one (Model B) they are separable. Model B is obtained from Model A with a minor modification. The formulation of the models is described on a small sized numerical example and the solutions are interpreted. Finally, computational results are obtained on test problems. © 2011 Elsevier Inc.