Abstract
The main feature of the method suggested in this paper is the assignment of priority to elements and priority elements are preferred to non-priority elements when assigning elements to stations. It gives the minimum number of stations under a predetermined cycle time. The work element time is considered to be invariant. This method has been tested by solving nearly all the problems available in the pertinent literature. This method yields better or similar results as available in the literature. A computer program incorporating the new heuristic method is presented in the paper.
Original language | English (US) |
---|---|
Pages (from-to) | 223-234 |
Number of pages | 12 |
Journal | Computers and Industrial Engineering |
Volume | 4 |
Issue number | 3 |
DOIs | |
State | Published - 1980 |
All Science Journal Classification (ASJC) codes
- Computer Science(all)
- Engineering(all)