Petri net-based algorithm for maximizing production rate in assembly lines

摘要

In this study, a new simple heuristic based on Petri net is presented for simple assembly line balancing problem type-2 (SALBP-2). The presented heuristic obtains a task order using the properties of Petri net, i.e. firing rule, token movement, and token condition. Tasks are assigned to the workstations using the backward procedure and the task order as a priority rule. The heuristic is a two-stage algorithm; a feasible solution is found in the first stage, and the feasible solution is improved using binary search procedure in the second stage. The comparison studies are presented between the presented heuristic algorithm and well-known priority rules, other Petri net-based algorithms, differential evolution algorithms, and genetic algorithms in the literature. The results show that the presented Petri net-based algorithm is efficient for solving SALBP-2.