{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:53:48Z","timestamp":1725900828491},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642052521"},{"type":"electronic","value":"9783642052538"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-05253-8_58","type":"book-chapter","created":{"date-parts":[[2009,11,20]],"date-time":"2009-11-20T16:31:05Z","timestamp":1258734665000},"page":"526-534","source":"Crossref","is-referenced-by-count":0,"title":["A Space Allocation Algorithm for Minimal Makespan in Space Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Chyuan","family":"Perng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi-Chiuan","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zih-Ping","family":"Ho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chin-Lun","family":"Ouyang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"58_CR1","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0925-5273(02)00427-9","volume":"84","author":"C.J. Liao","year":"2003","unstructured":"Liao, C.J., Lin, C.H.: Makespan minimization for two uniform parallel machines. International Journal of Production Economics\u00a084(2), 205\u2013213 (2003)","journal-title":"International Journal of Production Economics"},{"key":"58_CR2","first-page":"1","volume-title":"The Third Conference on Operations Research of Taiwan","author":"C. Perng","year":"2006","unstructured":"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.\u00a059, pp. 1\u20137. Yuan-Zhe University, Tao-Yuan County (2006)"},{"key":"58_CR3","first-page":"1","volume-title":"The Fourth Conference on Operations Research of Taiwan","author":"C. Perng","year":"2007","unstructured":"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.\u00a05, pp. 1\u201311. National Dong-Hwa University, Hwa-Lian City (2007)"},{"key":"58_CR4","unstructured":"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.\u00a04B, pp. 1\u20139 (2008)"},{"key":"58_CR5","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1109\/ICNC.2008.419","volume-title":"The 4th International Conference on Natural Computation","author":"C. Perng","year":"2008","unstructured":"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.\u00a07, pp. 202\u2013206. Shandong University, Jinan (2008), doi:10.1109\/ICNC.2008.419"},{"key":"58_CR6","doi-asserted-by":"crossref","unstructured":"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\u20134 (2009)","DOI":"10.1109\/NISS.2009.129"},{"issue":"2","key":"58_CR7","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/S0377-2217(02)00132-7","volume":"141","author":"D. Pisinger","year":"2002","unstructured":"Pisinger, D.: Heuristics for the container loading problem. European Journal of Operational Research\u00a0141(2), 382\u2013392 (2002)","journal-title":"European Journal of Operational Research"},{"issue":"3-4","key":"58_CR8","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/S0360-8352(98)00118-1","volume":"35","author":"D.R. Sule","year":"1998","unstructured":"Sule, D.R., Vijayasundaram, K.: A heuristic procedure for makespan minimization in job shops with multiple identical processors. Computers and Industrial Engineering\u00a035(3-4), 399\u2013402 (1998)","journal-title":"Computers and Industrial Engineering"},{"issue":"2","key":"58_CR9","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S0377-2217(01)00295-8","volume":"142","author":"G. Gallo","year":"2002","unstructured":"Gallo, G., Scutella, M.G.: A note on minimum makespan assembly plans. European Journal of Operational Research\u00a0142(2), 309\u2013320 (2002)","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"58_CR10","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1016\/j.cor.2008.01.007","volume":"36","author":"G.I. Zobolas","year":"2009","unstructured":"Zobolas, G.I., Tarantilis, C.D., Ioannou, G.: Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm. Computers & Operations Research\u00a036(4), 1249\u20131267 (2009)","journal-title":"Computers & Operations Research"},{"issue":"11","key":"58_CR11","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"Beasley, J.E.: OR-Library: distributing test problems by electronic mail. Journal of Operational Research Society\u00a041(11), 1069\u20131072 (1990)","journal-title":"Journal of Operational Research Society"},{"key":"58_CR12","unstructured":"Beasley, J.E.: OR-Library (5\/1\/2009), \n                    \n                      http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/info.htm"},{"key":"58_CR13","volume-title":"Scheduling theory, algorithms and systems","author":"M. Pinedo","year":"2002","unstructured":"Pinedo, M.: Scheduling theory, algorithms and systems. Prentice Hall Press, New Jersey (2002)"},{"issue":"1","key":"58_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1080\/00207547808930001","volume":"16","author":"R.A. Nichols","year":"1978","unstructured":"Nichols, R.A., Bulfin, R.L., Parker, R.G.: An interactive procedure for minimizing makespan on parallel processors. International Journal of Production Research\u00a016(1), 77\u201381 (1978)","journal-title":"International Journal of Production Research"},{"issue":"2","key":"58_CR15","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1016\/j.amc.2006.05.168","volume":"183","author":"Z. Lian","year":"2006","unstructured":"Lian, Z., Jiao, B., Gu, X.: A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan. Applied Mathematics and Computation\u00a0183(2), 1008\u20131017 (2006)","journal-title":"Applied Mathematics and Computation"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-05253-8_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:25:05Z","timestamp":1619781905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-05253-8_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642052521","9783642052538"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-05253-8_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}