A Space Allocation Algorithm for Minimal Early and Tardy Costs in Space Scheduling

The factory space for assembly is one of critical resources for the machine assembly industry. In the past, many researches discussed job shop or single machine scheduling problems with time constraint. In machinery, factory space constrains scheduling. The most common way for scheduling jobs in machinery industry is to assign jobs based on experience. Therefore, the main purpose of this research is to derive a method to schedule jobs for machinery industry and develop new dispatching rules. In this research, we develop an algorithm, Northwest corner searching algorithm to schedule jobs into the shop floor. In addition, two space dispatching rules, largest space requirement (LSR) and smallest space requirement (SSR), are also developed for sequencing jobs. We find that both the proposed algorithm and dispatching rule perform well in our experiments.