Authors: Ozcan Kilincci G Mirac Bayhan
Publish Date: 2006/02/25
Volume: 30, Issue: 11-12, Pages: 1165-1173
Abstract
A simple assembly line balancing problem of type1 SALBP1 aims to minimize the number of workstations for a given cycle time In the relevant literature several heuristics based on a branchandbound procedure tabu search and genetic algorithms GAs were proposed to solve SALBP1 In this paper an algorithm based on the reachability analysis of Petri nets is developed for SALBP1 The proposed algorithm searches enabled transitions or assignable tasks in the Petri net model of precedence relations between tasks and then the task minimizing the idle time is assigned to the station under consideration 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 70task problem by comparison with optimal solutions of traditional heuristics and a GA
Keywords: