Fuzzy branch-and-bound algorithm for flow shop scheduling


Temiz I., Erol S.

JOURNAL OF INTELLIGENT MANUFACTURING, cilt.15, sa.4, ss.449-454, 2004 (SCI İndekslerine Giren Dergi) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 15 Konu: 4
  • Basım Tarihi: 2004
  • Doi Numarası: 10.1023/b:jims.0000034107.72423.b6
  • Dergi Adı: JOURNAL OF INTELLIGENT MANUFACTURING
  • Sayfa Sayıları: ss.449-454

Özet

Scheduling is the allocation of resources over time to perform a collection of task. It is an important subject of production and operations management area. For most of scheduling problems made so far, the processing times of each job on each machine and due dates have been assigned as a real number. However in the real world, information is often ambiguous or imprecise. In this paper fuzzy concept are applied to the flow shop scheduling problems. The branch-and-bound algorithm of Ignall and Schrage was modified and rewritten for three-machine flow shop problems with fuzzy processing time. Fuzzy arithmetic on fuzzy numbers is used to determine the minimum completion time (C-max). Proposed algorithm gets a scheduling result with a membership function for the final completion time. With this membership function determined, a wider point of view is provided for the manager about the optimal schedule.