IEEE Transactions on Robotics and Automation · 1998 · 181 citations · 7 references
BusinessElectrical EngineeringIndustrial EngineeringDesign OptimizationOptimizationSchedulingCombinatorial OptimizationInteger ProgrammingLinear ProgrammingSchedule OptimizationScheduling OptimizationScheduling TheoryCycle TimeCycle Time AnalysisCycle Time OptimizationHoist SystemsOptimization-based SchedulingScheduling ConstraintsScheduling ProblemsTime Window Analysis
This paper proposes a model and a related algorithm for generating optimal cyclic schedules of hoist moves with time window constraints in a printed circuit board (PCB) electroplating facility. The algorithm is based on the branch and bound approach and requires the solution of a specific class of linear programming problems (LPP). These LPP are equivalent to the problems of the cycle time evaluation in bi-valued graphs. Computational experience is presented to compare the results obtained using this new algorithm with the ones proposed in the literature.
7