{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:40:43Z","timestamp":1775068843169,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,11,18]],"date-time":"2019-11-18T00:00:00Z","timestamp":1574035200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,11,18]],"date-time":"2019-11-18T00:00:00Z","timestamp":1574035200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003065","name":"University of Vienna","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003065","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2019,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In proposing a machine learning approach for a flow shop scheduling problem with alternative resources, sequence-dependent setup times, and blocking, this paper seeks to generate a tree-based priority rule in terms of a well-performing decision tree (DT) for dispatching jobs. Furthermore, generating a generic DT and RF that yields competitive results for instance scenarios that structurally differ from the training instances was another goal of our research. The proposed DT relies on high quality solutions, obtained using a constraint programming (CP) formulation. Novel aspects include a unified representation of job sequencing and machine assignment decisions, as well as the generation of random forests (RF) to counteract overfitting behaviour. To show the performance of the proposed approaches, different instance scenarios for two objectives (makespan and total tardiness minimisation) were implemented, based on randomised problem data. The background of this approach is a real-world physical system of an industrial partner that represents a typical shop floor for many production processes, such as furniture and window construction. The results of a comparison of the DT and RF approach with two priority dispatching rules, the original CP solutions and tight lower bounds retrieved from a strengthened mixed-integer programming (MIP) formulation show that the proposed machine learning approach performs well in most instance sets for the makespan objective and in all sets for the total tardiness objective.\n<\/jats:p>","DOI":"10.1007\/s00291-019-00567-8","type":"journal-article","created":{"date-parts":[[2019,11,18]],"date-time":"2019-11-18T02:01:41Z","timestamp":1574042501000},"page":"871-893","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["A machine learning approach for flow shop scheduling problems with alternative resources, sequence-dependent setup times, and blocking"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5553-1683","authenticated-orcid":false,"given":"Frank","family":"Benda","sequence":"first","affiliation":[]},{"given":"Roland","family":"Braune","sequence":"additional","affiliation":[]},{"given":"Karl F.","family":"Doerner","sequence":"additional","affiliation":[]},{"given":"Richard F.","family":"Hartl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,18]]},"reference":[{"issue":"6","key":"567_CR1","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1287\/opre.17.6.941","volume":"17","author":"E Balas","year":"1969","unstructured":"Balas E (1969) Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Oper Res 17(6):941\u2013957","journal-title":"Oper Res"},{"key":"567_CR2","first-page":"621","volume":"3","author":"H Blockeel","year":"2003","unstructured":"Blockeel H, Struyf J (2003) Efficient algorithms for decision tree cross-validation. J Mach Learn Res 3:621\u2013650","journal-title":"J Mach Learn Res"},{"issue":"5","key":"567_CR3","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10951-012-0305-x","volume":"16","author":"R Braune","year":"2013","unstructured":"Braune R, Z\u00e4pfel G, Affenzeller M (2013) Enhancing local search algorithms for job shops with min-sum objectives by approximate move evaluation. J Sched 16(5):495\u2013518","journal-title":"J Sched"},{"issue":"1","key":"567_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman L (2001) Random forests. Mach Learn 45(1):5\u201332","journal-title":"Mach Learn"},{"issue":"4","key":"567_CR5","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s00291-003-0133-7","volume":"25","author":"P Brucker","year":"2003","unstructured":"Brucker P, Heitmann S, Hurink J (2003) Flow-shop problems with intermediate buffers. OR Spectr 25(4):549\u2013574","journal-title":"OR Spectr"},{"issue":"3","key":"567_CR6","first-page":"621","volume":"8","author":"HH Doh","year":"2014","unstructured":"Doh HH, Yu JM, Kwon YJ, Shin JH, Kim HW, Nam SH, Lee DH (2014) Decision tree based scheduling for flexible job shops with multiple process plans. Int J Mech Aerosp Ind Mechatron Manuf Eng 8(3):621\u2013627","journal-title":"Int J Mech Aerosp Ind Mechatron Manuf Eng"},{"issue":"3","key":"567_CR7","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"NG Hall","year":"1996","unstructured":"Hall NG, Sriskandarajah C (1996) A survey of machine scheduling problems with blocking and no-wait in process. Oper Res 44(3):510\u2013525","journal-title":"Oper Res"},{"key":"567_CR8","unstructured":"Ho TK (1995) Random decision forests. In: Proceedings of 3rd international conference on document analysis and recognition, vol 1, pp 278\u2013282"},{"issue":"1","key":"567_CR9","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/S0377-2217(03)00401-6","volume":"159","author":"ME Kurz","year":"2004","unstructured":"Kurz ME, Askin RG (2004) Scheduling flexible flow lines with sequence-dependent setup times. Eur J Oper Res 159(1):66\u201382","journal-title":"Eur J Oper Res"},{"issue":"11","key":"567_CR10","doi-asserted-by":"publisher","first-page":"2085","DOI":"10.1080\/00207549008942855","volume":"28","author":"R Leisten","year":"1990","unstructured":"Leisten R (1990) Flowshop sequencing problems with limited buffer storage. Int J Prod Res 28(11):2085\u20132100","journal-title":"Int J Prod Res"},{"issue":"6","key":"567_CR11","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10951-005-4781-0","volume":"8","author":"X Li","year":"2005","unstructured":"Li X, Olafsson S (2005) Discovering dispatching rules using data mining. J Sched 8(6):515\u2013527","journal-title":"J Sched"},{"issue":"3","key":"567_CR12","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/S0377-2217(01)00338-1","volume":"143","author":"A Mascis","year":"2002","unstructured":"Mascis A, Pacciarelli D (2002) Job-shop scheduling with blocking and no-wait constraints. Eur J Oper Res 143(3):498\u2013517","journal-title":"Eur J Oper Res"},{"issue":"1","key":"567_CR13","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.ijpe.2010.06.004","volume":"128","author":"S Olafsson","year":"2010","unstructured":"Olafsson S, Li X (2010) Learning effective new single machine dispatching rules from optimal scheduling data. Int J Prod Econ 128(1):118\u2013126","journal-title":"Int J Prod Econ"},{"issue":"1","key":"567_CR14","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1287\/opre.25.1.45","volume":"25","author":"SS Panwalkar","year":"1977","unstructured":"Panwalkar SS, Iskander W (1977) A survey of scheduling rules. Oper Res 25(1):45\u201361","journal-title":"Oper Res"},{"key":"567_CR15","volume-title":"Scheduling: theory, algorithms, and systems","author":"M Pinedo","year":"2002","unstructured":"Pinedo M (2002) Scheduling: theory, algorithms, and systems, 4th edn. Prentice Hall, Englewood Cliffs","edition":"4"},{"issue":"1","key":"567_CR16","first-page":"81","volume":"1","author":"JR Quinlan","year":"1986","unstructured":"Quinlan JR (1986) Induction of decision trees. Mach Learn 1(1):81\u2013106","journal-title":"Mach Learn"},{"key":"567_CR17","volume-title":"C4.5: Programs for machine learning","author":"JR Quinlan","year":"1993","unstructured":"Quinlan JR (1993) C4.5: Programs for machine learning. Morgan Kaufmann Publishers Inc., San Francisco"},{"issue":"1","key":"567_CR18","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.ejor.2004.01.022","volume":"165","author":"R Ruiz","year":"2005","unstructured":"Ruiz R, Maroto C, Alcaraz J (2005) Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics. Eur J Oper Res 165(1):34\u201354","journal-title":"Eur J Oper Res"},{"issue":"6","key":"567_CR19","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1016\/j.engappai.2012.04.001","volume":"25","author":"A Shahzad","year":"2012","unstructured":"Shahzad A, Mebarki N (2012) Data mining based job dispatching using hybrid simulation-optimization approach for shop scheduling problem. Eng Appl Artif Intell 25(6):1173\u20131181","journal-title":"Eng Appl Artif Intell"},{"issue":"8","key":"567_CR20","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1287\/mnsc.33.8.1035","volume":"33","author":"APJ Vepsalainen","year":"1987","unstructured":"Vepsalainen APJ, Morton TE (1987) Priority rules for job shops with weighted tardiness costs. Manag Sci 33(8):1035\u20131047","journal-title":"Manag Sci"},{"issue":"1","key":"567_CR21","first-page":"23","volume":"4","author":"T Wuest","year":"2016","unstructured":"Wuest T, Weimer D, Irgens C, Thoben KD (2016) Machine learning in manufacturing: advantages, challenges, and applications. Prod Manuf Res 4(1):23\u201345","journal-title":"Prod Manuf Res"},{"key":"567_CR22","volume-title":"Multivariate statistical methods in quality management","author":"K Yang","year":"2004","unstructured":"Yang K, Trewn J (2004) Multivariate statistical methods in quality management. McGraw-Hill, New York"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-019-00567-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-019-00567-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-019-00567-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T00:16:45Z","timestamp":1605572205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-019-00567-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,18]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["567"],"URL":"https:\/\/doi.org\/10.1007\/s00291-019-00567-8","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,18]]},"assertion":[{"value":"31 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 November 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}