Abstract
Spatial resources are often an important consideration in shipbuilding and large-scale manufacturing industries. Spatial scheduling problems (SSP) involve the non-overlapping arrangement of jobs within a limited physical workspace such that some scheduling objective is optimized. The jobs are typically heavy and occupy large areas, requiring that the same contiguous units of space be assigned throughout the duration of their processing time. This adds an additional level of complexity to the general scheduling problem. Since solving large instances using exact methods becomes computationally intractable, there is a need to develop alternate solution methodologies to provide near optimal solutions for these problems. Much of the literature focuses on minimizing the makespan of the schedule. We propose two heuristic methods for the minimum sum of completion times objective. Our approach is to group jobs into a batch and then apply a scheduling heuristic to the batches. We show that grouping jobs earlier in the schedule, although intuitive, can result in poor performance when jobs have sufficiently large differences in processing times. We provide bounds on the performance of the algorithms and also present computational results comparing the solutions to the optimal objective obtained from the integer programming formulation for SSP. With a smaller number of jobs, both algorithms produce comparable solutions. For instances with a larger number of jobs and a higher variability in spatial dimensions, we observe that the efficient area model outperforms the iterative model both in terms of solution quality and run time.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Brucker, P., Kovalyov, M.Y., Shafransky, Y.M., Werner, F.: Batch scheduling with deadlines on parallel machines. Ann. Oper. Res. 83, 23–40 (1998)
Caprace, J.D., Petcu, C., Velarde, M., Rigo, P.: Optimization of shipyard space allocation and scheduling using a heuristic algorithm. J. Mar. Sci. Technol. 18(3), 404–417 (2013)
Castillo, I., Kampas, F.J., Pintér, J.D.: Solving circle packing problems by global optimization: numerical results and industrial applications. Eur. J. Oper. Res. 191(3), 786–802 (2008)
Cho, K., Chung, K., Park, C., Park, J., Kim, H.: A spatial scheduling system for block painting process in shipbuilding. CIRP Ann. Manuf. Technol. 50(1), 339–342 (2001)
Duin, C., Sluis, E.: On the complexity of adjacent resource scheduling. J. Sched. 9(1), 49–62 (2006)
Garcia, C.J.: Optimization models and algorithms for spatial scheduling. Ph.D. thesis, Old Dominion University, Norfolk (2010)
Garcia, C., Rabadi, G.: A meta-raps algorithm for spatial scheduling with release times. Int. J. Plann. Sched. 1, 19–31 (2011)
Garcia, C., Rabadi, G.: Exact and approximate methods for parallel multiple-area spatial scheduling with release times. OR Spectr. 35(3), 639–657 (2013)
Koh, S., Logendran, R., Choi, D., Woo, S.: Spatial scheduling for shape-changing mega-blocks in a shipbuilding company. Int. J. Prod. Res. 49(23), 7135–7149 (2011)
Lee, C.Y., Uzsoy, R., Martin-Vega, L.A.: Efficient algorithms for scheduling semiconductor burn-in operations. Oper. Res. 40(4), 764–775 (1992)
Lee, K., Jun, K.L., Park, H.K., Hong, J.S., Lee, J.S.: Developing scheduling systems for Daewoo shipbuilding: {DAS} project. Eur. J. Oper. Res. 97(2), 380–395 (1997)
Leung, J., Kelly, L., Anderson, J.H.: Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC Press, Boca Raton (2004)
Lodi, A., Martello, S., Monaci, M.: Two-dimensional packing problems: a survey. Eur. J. Oper. Res. 141(2), 241–252 (2002)
Mathirajan, M., Sivakumar, A.: A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor. Int. J. Adv. Manuf. Technol. 29(9–10), 990–1001 (2006)
Park, K., Lee, K., Park, S., Kim, S.: Modeling and solving the spatial block scheduling problem in a shipbuilding company. Comput. Ind. Eng. 30(3), 357–364 (1996)
Perng, C., Lai, Y.C., Ho, Z.P.: A space allocation algorithm for minimal early and tardy costs in space scheduling. In: International Conference on New Trends in Information and Service Science, 2009 (NISS ‘09), pp. 33–36 (2009)
Pisinger, D., Sigurd, M.: The two-dimensional bin packing problem with variable bin sizes and costs. Discret. Optim. 2(2), 154–167 (2005)
Raj, P., Srivastava, R.K.: Analytical and heuristic approaches for solving the spatial scheduling problem. In: 2007 IEEE International Conference on Industrial Engineering and Engineering Management, pp. 1093–1097 (2007)
Smith, W.E.: Various optimizers for single-stage production. Nav. Res. Logist. Q. 3(1–2), 59–66 (1956)
Vazirani, V.V.: Approximation Algorithms. Springer, New York (2001)
Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms, 1st edn. Cambridge University Press, New York (2011)
Zhang, Z., Chen, J.: Solving the spatial scheduling problem: a two-stage approach. Int. J. Prod. Res. 50(10), 2732–2743 (2012)
Zheng, J., Jiang, Z., Chen, Q., Liu, Q.: Spatial scheduling algorithm minimising makespan at block assembly shop in shipbuilding. Int. J. Prod. Res. 49(8), 2351–2371 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Srinivasan, S., Brooks, J.P., Wilson, J.H. (2015). Batching-Based Approaches for Optimized Packing of Jobs in the Spatial Scheduling Problem. In: Fasano, G., Pintér, J. (eds) Optimized Packings with Applications. Springer Optimization and Its Applications, vol 105. Springer, Cham. https://doi.org/10.1007/978-3-319-18899-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-18899-7_12
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18898-0
Online ISBN: 978-3-319-18899-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)