A note on "A mixed integer programming model for advanced planning and scheduling (APS)"

Ornek A., Ozpeynirci S., Ozturk C.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, cilt.203, sa.3, ss.784-785, 2010 (SCI-Expanded, Scopus) identifier identifier

  • Yayın Türü: Makale / Editöre Mektup
  • Cilt numarası: 203 Sayı: 3
  • Basım Tarihi: 2010
  • Doi Numarası: 10.1016/j.ejor.2009.09.025
  • Dergi Adı: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.784-785
  • Orta Doğu Teknik Üniversitesi Kuzey Kıbrıs Kampüsü Adresli: Hayır

Özet

In a recent paper, Chen and Ji [Chen, K., Ji, P., 2007. A mixed integer programming model for advanced planning and scheduling (APS). European journal of Operational Research 181, 515-522] develop a mixed integer programming model for advanced planning and scheduling problem that considers capacity constraints and precedence relations between the operations. The orders require processing of several operations on eligible machines. The model presented in the above paper works for the case where each operation can be processed on only one machine. However, machine eligibility means that only a subset of machines are capable of processing a job and this subset may include more than one machine. We provide a general model for advanced planning and scheduling problems with machine eligibility. Our model can be used for problems where there are alternative machines that an operation can be assigned to. (C) 2009 Elsevier B.V. All rights reserved.