Abstract

A new algorithm for the distributed simulation and evaluation of on-line schedules is presented. Generally, on-line scheduling has often been restricted to scheduling activities on a single machine or workcell. The exploratory research reported in this paper expands on-line scheduling to encompass several machines or workcells. Branch and bound search techniques are used in the simulation to reduce the number of simulations simultaneously in execution. The algorithm is applied for the distributed simulation of on-line schedules for a manufacturing example. 1. INTRODUCTION Several obstacles prevent current assembly and manufacturing lines from capitalizing on the promises of complete automation. Among these are the difficulties in scheduling 1 resources and ordering processes such that optimal use is made of the current configuration. Fox and Kempf [FoKe85] distinguish the differences between planning and scheduling and suggest that a distinction is both essential and beneficial. Wh...

Citations