A P-invariant-based algorithm for simple assembly line balancing problem of type-1

KILINÇCI Ö., Bayhan G. M.

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, cilt.37, ss.400-409, 2008 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 37
  • Basım Tarihi: 2008
  • Doi Numarası: 10.1007/s00170-007-0975-2
  • Dergi Adı: INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.400-409
  • Anahtar Kelimeler: assembly line balancing, Petri nets, SALBP-1, heuristics, AUTOMATED MANUFACTURING SYSTEMS, PETRI-NET APPROACH, GENETIC ALGORITHMS, DISASSEMBLY PROCESSES, TABU SEARCH, DESIGN, OPERATION, MODELS
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

A simple assembly line balancing problem of type-1 (SALBP-1) concerns minimizing the number of workstations on an assembly line for a given cycle time. In this problem only a single product with deterministic task times is considered. Since the SALBP-1 is known as an NP-hard, considerable research effort has been spent to develop heuristic approaches. In this study we develop a different heuristic approach based on the P-invariants of Petri nets. The algorithm is coded in MATLAB, and its efficiency is tested on Talbot's and Hoffmann's benchmark datasets according to some performance measures and classifications. A computational study validates its effectiveness on Tonge's 70-task problem by comparison with solutions of traditional heuristics and a genetic algorithm reported to perform well.