A comparative evaluation of heuristic line balancing techniques
Management Science
A survey of exact algorithms for the simple assembly line balancing problem
Management Science
Optimally balancing large assembly lines with `FABLE'
Management Science
Eureka: a hybrid system for assembly line balancing
Management Science
Genetic algorithms for assembly line balancing with various objectives
Computers and Industrial Engineering - Special issue: IE in Korea
System reconfiguration to avoid deadlocks in automated manufacturing systems
Computers and Industrial Engineering
A petri net approach to disassembly process planning
Proceedings of the 23rd international conference on on Computers and industrial engineering
Fault-tolerant deadlock avoidance algorithm for assembly processes
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Finding optimal line balances with OptPack
Operations Research Letters
How to design effective priority rules: Example of simple assembly line balancing
Computers and Industrial Engineering
| Hi-index | 0.00 |
The objective of simple assembly line balancing problem type-1 (SALBP-1) is to minimize the number of workstations on an assembly line for a given cycle time. Since SALBP-1 is NP-hard, many iterative backtracking heuristics based on branch and bound procedure, tabu search, and genetic algorithms were developed to solve SALBP-1. In this study, a new heuristic algorithm based on Petri net approach is presented to solve the problem. The presented algorithm makes an order of firing sequence of transitions from Petri net model of precedence diagram. Task is assigned to a workstation using this order and backward procedure. 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. Computational study validates its effectiveness on the benchmark problems. Also comparison results show that the algorithm is efficiency to solve SALBP-1.