DETERMINING OPTIMAL CYCLIC HOIST SCHEDULES IN A SINGLE-HOIST ELECTROPLATING LINE

1 March 1994

journal article
research article
Published by Taylor & Francis in IIE Transactions

Vol. 26 (2) , 25-33
https://doi.org/10.1080/07408179408966593

Abstract

We consider the problem of determining a maximum throughput cyclic schedule for the operations of a material handling hoist in an automated electroplating line. The proposed algorithm applies a set of simple algebraic inequalities to derive candidate schedules and uses a branch-and-bound-based search process to identify the optimal one. Computational results with both benchmark and random test problems are presented.

Keywords

OPTIMAL CYCLIC
DETERMINING OPTIMAL
SINGLE HOIST
CYCLIC HOIST
HOIST ELECTROPLATING
ELECTROPLATING LINE
HOIST SCHEDULES

This publication has 2 references indexed in Scilit:

The Minimum Common-Cycle Algorithm for Cyclic Scheduling of Two Material Handling Hoists with Time Window Constraints
Management Science, 1991
Hoist Scheduling For A PCB Electroplating Facility
IIE Transactions, 1988