The factory space is one of the critical resources for the machine assembly industry. In machinery industry, space utilizations are critical to the efficiency of a schedule. The higher the utilization of a schedule is, the quicker the jobs can be done. Therefore, the main purpose of this research is to derive a method to allocate jobs into the shop floor to minimize the makespan for the machinery industry. In this research, we develop an algorithm, Longest Contact Edge Algorithm, to schedule jobs into the shop floor. We employed the algorithm to allocate space for jobs and found that the Longest Contact Edge Algorithm outperforms the Northwest Algorithm for obtaining better allocations. However, the Longest Contact Edge Algorithm results in more time complexity than that of the Northwest Algorithm. ? 2009 Springer-Verlag.
Relation:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Volume 5855 LNAI, 2009, Pages 526-534
