{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T00:36:48Z","timestamp":1767832608697,"version":"3.49.0"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T00:00:00Z","timestamp":1693612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T00:00:00Z","timestamp":1693612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"ZHAW Zurich University of Applied Sciences"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2024,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Car mass production commonly involves a moving assembly line that mixes several car models. This requires plenty of material supplies at the line side, but available space is scarce. Thus, material is placed apart from ideal positions. Then, picking it up involves walking along the line. This time is non-productive and can encompass 10\u201315% of total production time. Thus, it is important to estimate and minimize it during production planning. However, the calculations are difficult because the conveyor continuously moves. Therefore, most literature bounds walking time by a constant, but this discards valuable potential. To better approximate it, we use a time-dependent V-shaped function. A comparison indicates that for a majority of instances, constant walking time estimates of 95% confidence are at least 51% higher. Then, we introduce a model to optimize material positions such that the model-mix walking time is minimized. This poses an NP-hard sequencing problem with a recursive and nonlinear objective function. Our key discovery is a lower bound on the objective of partial solutions, established by a Lagrangian relaxation that can be solved in quadratic time. Resulting branch and bound based algorithms allow to quickly and reliably optimize up to the largest real-world sized instances.<\/jats:p>","DOI":"10.1007\/s10951-023-00787-5","type":"journal-article","created":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T16:01:48Z","timestamp":1693670508000},"page":"257-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Mixed-model moving assembly line material placement optimization for a shorter time-dependent worker walking time"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7359-6587","authenticated-orcid":false,"given":"Helmut A.","family":"Sedding","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,2]]},"reference":[{"key":"787_CR1","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.cor.2019.04.005","volume":"108","author":"E \u00c1lvarez-Miranda","year":"2019","unstructured":"\u00c1lvarez-Miranda, E., & Pereira, J. (2019). On the complexity of assembly line balancing problems. Computers & Operations Research, 108, 182\u2013186. https:\/\/doi.org\/10.1016\/j.cor.2019.04.005","journal-title":"Computers & Operations Research"},{"issue":"3","key":"787_CR2","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1016\/j.ejor.2006.07.044","volume":"187","author":"C Andr\u00e9s","year":"2008","unstructured":"Andr\u00e9s, C., Miralles, C., & Pastor, R. (2008). Balancing and scheduling tasks in assembly lines with sequence-dependent setup times. European Journal of Operational Research, 187(3), 1212\u20131223. https:\/\/doi.org\/10.1016\/j.ejor.2006.07.044","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"787_CR3","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1016\/j.cie.2010.07.028","volume":"59","author":"KR Baker","year":"2010","unstructured":"Baker, K. R., & Keller, B. (2010). Solving the single-machine sequencing problem using integer programming. Computers & Industrial Engineering, 59(4), 730\u2013735. https:\/\/doi.org\/10.1016\/j.cie.2010.07.028","journal-title":"Computers & Industrial Engineering"},{"key":"787_CR4","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BFb0121051","volume":"24","author":"E Balas","year":"1985","unstructured":"Balas, E. (1985). On the facial structure of scheduling polyhedra. Mathematical Programming Study, 24, 179\u2013218. https:\/\/doi.org\/10.1007\/BFb0121051","journal-title":"Mathematical Programming Study"},{"issue":"2","key":"787_CR5","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.ijpe.2012.10.020","volume":"142","author":"O Batta\u00efa","year":"2013","unstructured":"Batta\u00efa, O., & Dolgui, A. (2013). A taxonomy of line balancing problems and their solution approaches. International Journal of Production Economics, 142(2), 259\u2013277. https:\/\/doi.org\/10.1016\/j.ijpe.2012.10.020","journal-title":"International Journal of Production Economics"},{"key":"787_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2022.108673","volume":"250","author":"O Batta\u00efa","year":"2022","unstructured":"Batta\u00efa, O., & Dolgui, A. (2022). Hybridizations in line balancing problems: A comprehensive review on new trends and formulations. International Journal of Production Economics, 250, 108673. https:\/\/doi.org\/10.1016\/j.ijpe.2022.108673","journal-title":"International Journal of Production Economics"},{"issue":"3","key":"787_CR7","doi-asserted-by":"publisher","first-page":"2016","DOI":"10.1016\/j.ejor.2005.12.017","volume":"177","author":"J Bautista","year":"2007","unstructured":"Bautista, J., & Pereira, J. (2007). Ant algorithms for a time and space constrained assembly line balancing problem. European Journal of Operational Research, 177(3), 2016\u20132032. https:\/\/doi.org\/10.1016\/j.ejor.2005.12.017","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"787_CR8","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1016\/j.ejor.2004.07.023","volume":"168","author":"C Becker","year":"2006","unstructured":"Becker, C., & Scholl, A. (2006). A survey on problems and methods in generalized assembly line balancing. European Journal of Operational Research, 168(3), 694\u2013715. https:\/\/doi.org\/10.1016\/j.ejor.2004.07.023","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"787_CR9","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/j.ejor.2008.11.051","volume":"199","author":"C Becker","year":"2009","unstructured":"Becker, C., & Scholl, A. (2009). Balancing assembly lines with variable parallel workplaces: Problem definition and effective solution procedure. European Journal of Operational Research, 199(2), 359\u2013374. https:\/\/doi.org\/10.1016\/j.ejor.2008.11.051","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"787_CR10","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/s00291-007-0095-2","volume":"30","author":"N Boysen","year":"2008","unstructured":"Boysen, N., Fliedner, M., & Scholl, A. (2008). Sequencing mixed-model assembly lines to minimize part inventory cost. OR Spectrum, 30(3), 611\u2013633. https:\/\/doi.org\/10.1007\/s00291-007-0095-2","journal-title":"OR Spectrum"},{"key":"787_CR11","doi-asserted-by":"publisher","unstructured":"Boysen, N., Fliedner, M., & Scholl, A. (2009a). Level Scheduling for batched JIT supply. Flexible Services and Manufacturing Journal, 21(1\u20132), 31\u201350. https:\/\/doi.org\/10.1007\/s10696-009-9058-z","DOI":"10.1007\/s10696-009-9058-z"},{"key":"787_CR12","doi-asserted-by":"publisher","unstructured":"Boysen, N., Fliedner, M., & Scholl, A. (2009b). Level scheduling of mixed-model assembly lines under storage constraints. International Journal of Production Research, 47(10), 2669\u20132684. https:\/\/doi.org\/10.1080\/00207540701725067","DOI":"10.1080\/00207540701725067"},{"key":"787_CR13","doi-asserted-by":"publisher","unstructured":"Boysen, N., Fliedner, M., & Scholl, A. (2009c). Sequencing mixed-model assembly lines: Survey, classification and model critique. European Journal of Operational Research, 192(2), 25. https:\/\/doi.org\/10.1016\/j.ejor.2007.09.013","DOI":"10.1016\/j.ejor.2007.09.013"},{"issue":"3","key":"787_CR14","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1016\/j.ejor.2011.08.009","volume":"216","author":"N Boysen","year":"2012","unstructured":"Boysen, N., Scholl, A., & Wopperer, N. (2012). Resequencing of mixed-model assembly lines: Survey and research agenda. European Journal of Operational Research, 216(3), 594\u2013604. https:\/\/doi.org\/10.1016\/j.ejor.2011.08.009","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"787_CR15","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.ejor.2014.09.065","volume":"242","author":"N Boysen","year":"2015","unstructured":"Boysen, N., Emde, S., Hoeck, M., & Kauderer, M. (2015). Part logistics in the automotive industry: Decision problems, literature review and research agenda. European Journal of Operational Research, 242(1), 107\u2013120. https:\/\/doi.org\/10.1016\/j.ejor.2014.09.065","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"787_CR16","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1016\/j.ejor.2021.11.043","volume":"301","author":"N Boysen","year":"2022","unstructured":"Boysen, N., Schulze, P., & Scholl, A. (2022). Assembly line balancing: What happened in the last fifteen years? European Journal of Operational Research, 301(3), 797\u2013814. https:\/\/doi.org\/10.1016\/j.ejor.2021.11.043","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"787_CR17","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1093\/comjnl\/14.4.422","volume":"14","author":"RP Brent","year":"1971","unstructured":"Brent, R. P. (1971). An algorithm with guaranteed convergence for finding a zero of a function. The Computer Journal, 14(4), 422\u2013425. https:\/\/doi.org\/10.1093\/comjnl\/14.4.422","journal-title":"The Computer Journal"},{"issue":"1","key":"787_CR18","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1080\/07408170590516854","volume":"37","author":"Y Bukchin","year":"2005","unstructured":"Bukchin, Y., & Meller, R. D. (2005). A space allocation algorithm for assembly line components. IIE Transactions, 37(1), 51\u201361. https:\/\/doi.org\/10.1080\/07408170590516854","journal-title":"IIE Transactions"},{"issue":"1","key":"787_CR19","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V \u010cern\u00fd","year":"1985","unstructured":"\u010cern\u00fd, V. (1985). Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. Journal of Optimization Theory and Applications, 45(1), 41\u201351. https:\/\/doi.org\/10.1007\/BF00940812","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"2","key":"787_CR20","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s00291-016-0433-3","volume":"38","author":"R Esmaeilbeigi","year":"2016","unstructured":"Esmaeilbeigi, R., Naderi, B., & Charkhgard, P. (2016). New formulations for the setup assembly line balancing and scheduling problem. OR Spectrum, 38(2), 493\u2013518. https:\/\/doi.org\/10.1007\/s00291-016-0433-3","journal-title":"OR Spectrum"},{"issue":"9","key":"787_CR21","doi-asserted-by":"publisher","first-page":"1479","DOI":"10.1007\/s00170-012-4116-1","volume":"64","author":"MH Farahani","year":"2013","unstructured":"Farahani, M. H., & Hosseini, L. (2013). Minimizing cycle time in single machine scheduling with start time-dependent processing times. The International Journal of Advanced Manufacturing Technology, 64(9), 1479\u20131486. https:\/\/doi.org\/10.1007\/s00170-012-4116-1","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"24","key":"787_CR22","doi-asserted-by":"publisher","first-page":"7253","DOI":"10.1080\/00207543.2010.503202","volume":"49","author":"C Finnsg\u00e5rd","year":"2011","unstructured":"Finnsg\u00e5rd, C., W\u00e4nstr\u00f6m, C., Medbo, L., & Neumann, W. P. (2011). Impact of materials exposure on assembly workstation performance. International Journal of Production Research, 49(24), 7253\u20137274. https:\/\/doi.org\/10.1080\/00207543.2010.503202","journal-title":"International Journal of Production Research"},{"issue":"12 Supplement","key":"787_CR23","doi-asserted-by":"publisher","first-page":"1861","DOI":"10.1287\/mnsc.1040.0263","volume":"50","author":"ML Fisher","year":"2004","unstructured":"Fisher, M. L. (2004). The Lagrangian Relaxation Method for Solving Integer Programming Problems. Management Science, 50(12 Supplement), 1861\u20131871. https:\/\/doi.org\/10.1287\/mnsc.1040.0263","journal-title":"Management Science"},{"key":"787_CR24","volume-title":"My life and work","author":"H Ford","year":"1922","unstructured":"Ford, H., & Crowther, S. (1922). My life and work. Doubleday Page & Co."},{"issue":"4","key":"787_CR25","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1137\/0204035","volume":"4","author":"MR Garey","year":"1975","unstructured":"Garey, M. R., & Johnson, D. S. (1975). Complexity results for multiprocessor scheduling under resource constraints. SIAM Journal on Computing, 4(4), 397\u2013411. https:\/\/doi.org\/10.1137\/0204035","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"787_CR26","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"MR Garey","year":"1978","unstructured":"Garey, M. R., & Johnson, D. S. (1978). \u201cStrong\u2019\u2019 NP-completeness results: Motivation, examples, and implications. Journal of the ACM, 25(3), 499\u2013508. https:\/\/doi.org\/10.1145\/322077.322090","journal-title":"Journal of the ACM"},{"issue":"2","key":"787_CR27","doi-asserted-by":"publisher","first-page":"330","DOI":"10.2307\/3689828","volume":"13","author":"MR Garey","year":"1988","unstructured":"Garey, M. R., Tarjan, R. E., & Wilfong, G. T. (1988). One-processor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Research, 13(2), 330\u2013348. https:\/\/doi.org\/10.2307\/3689828","journal-title":"Mathematics of Operations Research"},{"key":"787_CR28","doi-asserted-by":"publisher","unstructured":"Gawiejnowicz S (2020a) Models and Algorithms of Time-Dependent Scheduling, 2nd edn. Monographs in Theoretical Computer Science, Springer, Berlin, Heidelberg, https:\/\/doi.org\/10.1007\/978-3-662-59362-2","DOI":"10.1007\/978-3-662-59362-2"},{"key":"787_CR29","doi-asserted-by":"publisher","unstructured":"Gawiejnowicz, S. (2020b). A review of four decades of time-dependent scheduling: Main results, new topics, and open problems. Journal of Scheduling, 23(1), 3\u201347. https:\/\/doi.org\/10.1007\/s10951-019-00630-w","DOI":"10.1007\/s10951-019-00630-w"},{"issue":"2","key":"787_CR30","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1287\/moor.13.2.311","volume":"13","author":"B Hajek","year":"1988","unstructured":"Hajek, B. (1988). Cooling schedules for optimal annealing. Mathematics of Operations Research, 13(2), 311\u2013329. https:\/\/doi.org\/10.1287\/moor.13.2.311","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"787_CR31","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/BF01580223","volume":"6","author":"M Held","year":"1974","unstructured":"Held, M., Wolfe, P., & Crowder, H. P. (1974). Validation of subgradient optimization. Mathematical Programming, 6(1), 62\u201388. https:\/\/doi.org\/10.1007\/BF01580223","journal-title":"Mathematical Programming"},{"issue":"6","key":"787_CR32","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/s10951-016-0472-2","volume":"19","author":"F Jaehn","year":"2016","unstructured":"Jaehn, F., & Sedding, H. A. (2016). Scheduling with time-dependent discrepancy times. Journal of Scheduling, 19(6), 737\u2013757. https:\/\/doi.org\/10.1007\/s10951-016-0472-2","journal-title":"Journal of Scheduling"},{"issue":"7","key":"787_CR33","doi-asserted-by":"publisher","first-page":"2134","DOI":"10.1007\/s00453-017-0397-y","volume":"80","author":"Y Kawase","year":"2018","unstructured":"Kawase, Y., Makino, K., & Seimi, K. (2018). Optimal composition ordering problems for piecewise linear functions. Algorithmica, 80(7), 2134\u20132159. https:\/\/doi.org\/10.1007\/s00453-017-0397-y","journal-title":"Algorithmica"},{"issue":"1","key":"787_CR34","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.cie.2008.06.008","volume":"56","author":"AB Keha","year":"2009","unstructured":"Keha, A. B., Khowala, K., & Fowler, J. W. (2009). Mixed integer programming formulations for single machine scheduling problems. Computers & Industrial Engineering, 56(1), 357\u2013367. https:\/\/doi.org\/10.1016\/j.cie.2008.06.008","journal-title":"Computers & Industrial Engineering"},{"issue":"4598","key":"787_CR35","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by Simulated Annealing. Science, 220(4598), 671\u2013680. https:\/\/doi.org\/10.1126\/science.220.4598.671","journal-title":"Science"},{"issue":"4","key":"787_CR36","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10696-006-9029-6","volume":"17","author":"E Klampfl","year":"2006","unstructured":"Klampfl, E., Gusikhin, O., & Rossi, G. (2006). Optimization of workcell layouts in a mixed-model assembly line environment. International Journal of Flexible Manufacturing Systems, 17(4), 277\u2013299. https:\/\/doi.org\/10.1007\/s10696-006-9029-6","journal-title":"International Journal of Flexible Manufacturing Systems"},{"issue":"3","key":"787_CR37","first-page":"17","volume":"5","author":"AV Kononov","year":"1998","unstructured":"Kononov, A. V. (1998). Problems in scheduling theory on a single machine with job durations proportional to an arbitrary function. Diskretny\u012d Analiz i Issledovanie Operatsi\u012d, 5(3), 17\u201337.","journal-title":"Diskretny\u012d Analiz i Issledovanie Operatsi\u012d"},{"issue":"1","key":"787_CR38","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1108\/AA-05-2014-043","volume":"35","author":"V Lim\u00e8re","year":"2015","unstructured":"Lim\u00e8re, V., Landeghem, H. V., & Goetschalckx, M. (2015). A decision model for kitting and line stocking with variable operator walking distances. Assembly Automation, 35(1), 47\u201356. https:\/\/doi.org\/10.1108\/AA-05-2014-043","journal-title":"Assembly Automation"},{"issue":"2","key":"787_CR39","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1287\/opre.8.2.219","volume":"8","author":"AS Manne","year":"1960","unstructured":"Manne, A. S. (1960). On the job-shop scheduling problem. Operations Research, 8(2), 219\u2013223. https:\/\/doi.org\/10.1287\/opre.8.2.219","journal-title":"Operations Research"},{"key":"787_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108288","volume":"170","author":"D M\u00fcllerklein","year":"2022","unstructured":"M\u00fcllerklein, D., Fontaine, P., & Ostermeier, F. (2022). Integrated consideration of assembly line scheduling and feeding: A new model and case study from the automotive industry. Computers & Industrial Engineering, 170, 108288. https:\/\/doi.org\/10.1016\/j.cie.2022.108288","journal-title":"Computers & Industrial Engineering"},{"key":"787_CR41","volume-title":"Numerical recipes in C: The art of scientific computing","author":"WH Press","year":"1992","unstructured":"Press, W. H., Teukolsky, S. A., Vetterling, W. T., & Flannery, B. P. (1992). Numerical recipes in C: The art of scientific computing. Cambridge University Press."},{"issue":"1\u20133","key":"787_CR42","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF01581271","volume":"58","author":"M Queyranne","year":"1993","unstructured":"Queyranne, M. (1993). Structure of a simple scheduling polyhedron. Mathematical Programming, 58(1\u20133), 263\u2013285. https:\/\/doi.org\/10.1007\/BF01581271","journal-title":"Mathematical Programming"},{"key":"787_CR43","unstructured":"Queyranne, M., & Schulz, A. S. (1994). Polyhedral approaches to machine scheduling. (p. 3). Tech. rep.: Technische Universit\u00e4t Berlin, Fachbereich."},{"issue":"3","key":"787_CR44","first-page":"18","volume":"6","author":"ME Salveson","year":"1955","unstructured":"Salveson, M. E. (1955). The assembly line balancing problem. Journal of Industrial Engineering, 6(3), 18\u201325.","journal-title":"Journal of Industrial Engineering"},{"issue":"24","key":"787_CR45","doi-asserted-by":"publisher","first-page":"7586","DOI":"10.1080\/00207543.2019.1581957","volume":"57","author":"NA Schmid","year":"2019","unstructured":"Schmid, N. A., & Lim\u00e8re, V. (2019). A classification of tactical assembly line feeding problems. International Journal of Production Research, 57(24), 7586\u20137609. https:\/\/doi.org\/10.1080\/00207543.2019.1581957","journal-title":"International Journal of Production Research"},{"key":"787_CR46","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2020.102286","volume":"102","author":"NA Schmid","year":"2021","unstructured":"Schmid, N. A., Lim\u00e8re, V., & Raa, B. (2021). Mixed model assembly line feeding with discrete location assignments and variable station space. Omega, 102, 102286. https:\/\/doi.org\/10.1016\/j.omega.2020.102286","journal-title":"Omega"},{"issue":"1","key":"787_CR47","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s00291-011-0265-0","volume":"35","author":"A Scholl","year":"2013","unstructured":"Scholl, A., Boysen, N., & Fliedner, M. (2013). The assembly line balancing and scheduling problem with sequence-dependent setup times: Problem extension, model formulation and efficient heuristics. OR Spectrum, 35(1), 291\u2013320. https:\/\/doi.org\/10.1007\/s00291-011-0265-0","journal-title":"OR Spectrum"},{"key":"787_CR48","unstructured":"Sedding, H. A. (2017) Box placement as time dependent scheduling to reduce automotive assembly line worker walk times. In Proceedings of the 13th Workshop on Models and Algorithms for Planning and Scheduling Problems, Seeon, Germany, pp 92\u201394."},{"key":"787_CR49","doi-asserted-by":"publisher","unstructured":"Sedding, H. A. (2020a). Line side placement for shorter assembly line worker paths. IISE Transactions, 52(2), 181\u2013198. https:\/\/doi.org\/10.1080\/24725854.2018.1508929","DOI":"10.1080\/24725854.2018.1508929"},{"key":"787_CR50","doi-asserted-by":"publisher","unstructured":"Sedding, H. A. (2020b). Scheduling jobs with a V-shaped time-dependent processing time. Journal of Scheduling, 23(6), 751\u2013768. https:\/\/doi.org\/10.1007\/s10951-020-00665-4","DOI":"10.1007\/s10951-020-00665-4"},{"key":"787_CR51","doi-asserted-by":"publisher","unstructured":"Sedding, H. A. (2020c). Time-dependent path scheduling: Algorithmic minimization of walking time at the moving assembly line. Springer. https:\/\/doi.org\/10.1007\/978-3-658-28415-2","DOI":"10.1007\/978-3-658-28415-2"},{"key":"787_CR52","unstructured":"Sedding, H. A. (2021). A lower bound for sequentially placing boxes at the moving assembly line to minimize walking time. In Proceedings of the 3rd International Workshop on Dynamic Scheduling Problems, Adam Mickiewicz University, Pozna\u0144, Poland, pp 63\u201369."},{"issue":"1\u20132","key":"787_CR53","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith, W. E. (1956). Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3(1\u20132), 59\u201366. https:\/\/doi.org\/10.1002\/nav.3800030106","journal-title":"Naval Research Logistics Quarterly"},{"key":"787_CR54","doi-asserted-by":"publisher","unstructured":"Sternatz, J. (2014). Enhanced multi-Hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry. European Journal of Operational Research, 235(3), 740\u2013754. https:\/\/doi.org\/10.1016\/j.ejor.2013.11.005","DOI":"10.1016\/j.ejor.2013.11.005"},{"key":"787_CR55","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/j.ijpe.2014.07.022","volume":"159","author":"J Sternatz","year":"2015","unstructured":"Sternatz, J. (2015). The joint line balancing and material supply problem. International Journal of Production Economics, 159, 304\u2013318. https:\/\/doi.org\/10.1016\/j.ijpe.2014.07.022","journal-title":"International Journal of Production Economics"},{"issue":"2","key":"787_CR56","doi-asserted-by":"publisher","first-page":"B59","DOI":"10.1287\/mnsc.14.2.B59","volume":"14","author":"NT Thomopoulos","year":"1967","unstructured":"Thomopoulos, N. T. (1967). Line balancing-sequencing for mixed-model assembly. Management Science, 14(2), B59\u2013B75. https:\/\/doi.org\/10.1287\/mnsc.14.2.B59","journal-title":"Management Science"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-023-00787-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-023-00787-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-023-00787-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T07:19:03Z","timestamp":1747293543000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-023-00787-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,2]]},"references-count":56,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["787"],"URL":"https:\/\/doi.org\/10.1007\/s10951-023-00787-5","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,2]]},"assertion":[{"value":"25 May 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 September 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author has no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}