IIE Transactions, May 1st, 1996
This paper presents a local optimization algorithm for minimizing the number of transporters required for material handling in a cyclic processing line. Within a cycle, a given set of transportation operations must be performed. Each operation consists of picking up a work-in-process job at a stage and delivering it to the next stage. The length of time that a job can remain at a particular stage is restricted by a time window. The transporters that perform the operations move on a shared track, and traffic collisions must be avoided during their movements. To avoid traffic collisions, the ope...
HighBeam Research, Free Preview: 'A greedy algorithm to determine the number of transporters in a cyclic electroplating process.(Scheduling & Logistics)'... Full Membership required for unlimited access. Free 7-day trial.
Subscribers: HighBeam content is only available to HighBeam subscribers. Click the link above for more information.
