A Space Allocation Algorithm for Minimal Makespan in Space Scheduling Problems

Authors:
Chyuan Perng;Yi-Chiuan Lai;Zih-Ping Ho;Chin-Lun Ouyang
Affiliations:
Department of Industrial Engineering and Enterprise Information, Tunghai University, Taichung City, Taiwan 407;Department of Business Administration, Providence University, Shalu, Taichung County, Taiwan 433;Department of Industrial Engineering and Enterprise Information, Tunghai University, Taichung City, Taiwan 407;Department of Industrial Engineering and Enterprise Information, Tunghai University, Taichung City, Taiwan 407
Venue:
AICI '09 Proceedings of the International Conference on Artificial Intelligence and Computational Intelligence
Year:
2009

Citing 4
Cited 0

A heuristic procedure for makespan minimization in job shops with multiple identical processors

ICC&IE Selected papers from the 22nd ICC&IE conference on Computers & industrial engineering
Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm

Computers and Operations Research
On Space Resource Constrained Job Scheduling Problems- A Container Loading Heuristic Approach

ICNC '08 Proceedings of the 2008 Fourth International Conference on Natural Computation - Volume 07
A Space Allocation Algorithm for Minimal Early and Tardy Costs in Space Scheduling

NISS '09 Proceedings of the 2009 International Conference on New Trends in Information and Service Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.