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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Liao, C.J., Lin, C.H.: Makespan minimization for two uniform parallel machines. International Journal of Production Economics 84(2), 205–213 (2003)
Perng, C., Lai, Y.C., Zhuang, Z.Y., Ho, Z.P.: Application of scheduling technique to job space allocation problem in an assembly factory. In: The Third Conference on Operations Research of Taiwan, vol. 59, pp. 1–7. Yuan-Zhe University, Tao-Yuan County (2006)
Perng, C., Lai, Y.C., Zhuang, Z.Y., Ho, Z.P.: Job scheduling in machinery industry with space constrain. System Analysis Section. In: The Fourth Conference on Operations Research of Taiwan, vol. 5, pp. 1–11. National Dong-Hwa University, Hwa-Lian City (2007)
Perng, C., Lai, Y.C., Ho, Z.P.: Jobs scheduling in an assembly factory with space obstacles. In: The 18th International Conference on Flexible Automation and Intelligent Manufacturing, Skovde, Sweden, vol. 4B, pp. 1–9 (2008)
Perng, C., Lin, S.S., Ho, Z.P.: On space resource constrained job scheduling problems- A container loading heuristic approach. In: The 4th International Conference on Natural Computation, vol. 7, pp. 202–206. Shandong University, Jinan (2008), doi:10.1109/ICNC.2008.419
Perng, C., Lai, Y.C., Ho, Z.P.: A space allocation algorithm for minimal early and tardy costs in space scheduling. In: 3rd International Conference on New Trends in Information and Service Science papers (NISS), Sec.1(6), Beijing Friendship Hotel, Beijing, China, pp. 1–4 (2009)
Pisinger, D.: Heuristics for the container loading problem. European Journal of Operational Research 141(2), 382–392 (2002)
Sule, D.R., Vijayasundaram, K.: A heuristic procedure for makespan minimization in job shops with multiple identical processors. Computers and Industrial Engineering 35(3-4), 399–402 (1998)
Gallo, G., Scutella, M.G.: A note on minimum makespan assembly plans. European Journal of Operational Research 142(2), 309–320 (2002)
Zobolas, G.I., Tarantilis, C.D., Ioannou, G.: Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm. Computers & Operations Research 36(4), 1249–1267 (2009)
Beasley, J.E.: OR-Library: distributing test problems by electronic mail. Journal of Operational Research Society 41(11), 1069–1072 (1990)
Beasley, J.E.: OR-Library (5/1/2009), http://people.brunel.ac.uk/~mastjjb/jeb/info.htm
Pinedo, M.: Scheduling theory, algorithms and systems. Prentice Hall Press, New Jersey (2002)
Nichols, R.A., Bulfin, R.L., Parker, R.G.: An interactive procedure for minimizing makespan on parallel processors. International Journal of Production Research 16(1), 77–81 (1978)
Lian, Z., Jiao, B., Gu, X.: A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan. Applied Mathematics and Computation 183(2), 1008–1017 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Perng, C., Lai, YC., Ho, ZP., Ouyang, CL. (2009). A Space Allocation Algorithm for Minimal Makespan in Space Scheduling Problems. In: Deng, H., Wang, L., Wang, F.L., Lei, J. (eds) Artificial Intelligence and Computational Intelligence. AICI 2009. Lecture Notes in Computer Science(), vol 5855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05253-8_58
Download citation
DOI: https://doi.org/10.1007/978-3-642-05253-8_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05252-1
Online ISBN: 978-3-642-05253-8
eBook Packages: Computer ScienceComputer Science (R0)