{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:33:43Z","timestamp":1760240023679,"version":"build-2065373602"},"reference-count":90,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T00:00:00Z","timestamp":1550448000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["*"],"award-info":[{"award-number":["*"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data"],"abstract":"<jats:p>The development of new and better optimization and approximation methods for Job Shop Scheduling Problems (JSP) uses simulations to compare their performance. The test data required for this has an uncertain influence on the simulation results, because the feasable search space can be changed drastically by small variations of the initial problem model. Methods could benefit from this to varying degrees. This speaks in favor of defining standardized and reusable test data for JSP problem classes, which in turn requires a systematic describability of the test data in order to be able to compile problem adequate data sets. This article looks at the test data used for comparing methods by literature review. It also shows how and why the differences in test data have to be taken into account. From this, corresponding challenges are derived which the management of test data must face in the context of JSP research.<\/jats:p>","DOI":"10.3390\/data4010032","type":"journal-article","created":{"date-parts":[[2019,2,19]],"date-time":"2019-02-19T04:08:20Z","timestamp":1550549300000},"page":"32","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Need for Standardization and Systematization of Test Data for Job-Shop Scheduling"],"prefix":"10.3390","volume":"4","author":[{"given":"Edzard","family":"Weber","sequence":"first","affiliation":[{"name":"Department of Business Informatics, Processes and Systems, Potsdam University, 14469 Potsdam, Germany"}]},{"given":"Anselm","family":"Tiefenbacher","sequence":"additional","affiliation":[{"name":"Department of Business Informatics, Processes and Systems, Potsdam University, 14469 Potsdam, Germany"}]},{"given":"Norbert","family":"Gronau","sequence":"additional","affiliation":[{"name":"Department of Business Informatics, Processes and Systems, Potsdam University, 14469 Potsdam, Germany"}]}],"member":"1968","published-online":{"date-parts":[[2019,2,18]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1016\/0360-8352(96)00047-2","article-title":"A Tutorial Survey of Job-Shop Scheduling Problems Using Genetic Algorithms\u2014Representation","volume":"30","author":"Cheng","year":"1996","journal-title":"Comput. Ind. Eng."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF02023076","article-title":"Applying Tabu Search to the Job-Shop Scheduling Problem","volume":"41","author":"Trubian","year":"1993","journal-title":"Ann. Oper. Res."},{"key":"ref_3","first-page":"1","article-title":"Maschinenbelegungsplanung in entkoppelten Produktionssystemen","volume":"22","author":"Schneider","year":"2017","journal-title":"productivITy"},{"key":"ref_4","unstructured":"Scharbrodt, M. (2000). Produktionsplanung in der Prozessindustrie: Modelle, Effziente Algorithmen und Umsetzung. [Ph.D. Thesis, Technical University of Munich]."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","article-title":"An Algorithm for Solving the Job-Shop Problem","volume":"35","author":"Carlier","year":"1989","journal-title":"Manag. Sci."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","article-title":"A Computational Study of the Job-Shop Scheduling Problem","volume":"3","author":"Applegate","year":"1991","journal-title":"ORSA J. Comput."},{"key":"ref_7","unstructured":"Nakano, R., and Yamada, T. (1991, January 13\u201316). Conventional Genetic Algorithm for Job Shop Problems. Proceedings of the 4th International Conference on Genetic Algorithms, San Diego, CA, USA."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10951-005-6364-5","article-title":"An Advanced Tabu Search Algorithm for the Job Shop Problem","volume":"8","author":"Nowicki","year":"2005","journal-title":"J. Sched."},{"key":"ref_9","unstructured":"Van den Eynden, V., Corti, L., Wollard, M., Bishop, L., and Horton, L. (2011). Managing and Sharing Data: A Best Practice Guide for Researchers, UK Data Archive University of Essex. [3rd ed.]. OCLC: 727970452."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Vahrenkamp, R. (2008). Produktionsmanagement, Oldenbourg Verlag. [6th ed.].","DOI":"10.1524\/9783486848243"},{"key":"ref_11","unstructured":"Fisch\u00e4der, H., G\u00f6hler, R., and Schneider, H.M. (2017). Maschinenbelegungsplanung in Mehrstufigen Produktionssystemen. [Ph.D. Thesis, Technische Universitat Ilmenau]. Volume 22."},{"key":"ref_12","unstructured":"Henning, A. (2002). Praktische Job-Shop Scheduling-Probleme. [Ph.D. Thesis, Friedrich Schiller University]."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Jahnke, B., and Wall, F. (2001). Reihenfolgeplanung in Produktionsnetzwerken. IT-gest\u00fctzte Betriebswirtschaftliche Entscheidungsprozesse, Gabler Verlag.","DOI":"10.1007\/978-3-663-05864-9"},{"key":"ref_14","unstructured":"Pinedo, M. (2016). Scheduling: Theory, Algorithms, and Systems, Springer. [5th ed.]."},{"key":"ref_15","first-page":"23","article-title":"Reihenfolgeplanung Im Zeitalter von Industrie 4.0","volume":"23","author":"Gronau","year":"2018","journal-title":"productivITy"},{"key":"ref_16","unstructured":"Muth, J.F., and Thompson, G.L. (1963). Industrial Scheduling, Prentice Hall."},{"key":"ref_17","unstructured":"Baker, K.R. (1974). Introduction to Sequencing and Scheduling, Wiley. Open Library ID: OL5047415M."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of Machine Scheduling Problems","volume":"Volume 1","author":"Hammer","year":"1977","journal-title":"Studies in Integer Programming"},{"key":"ref_19","unstructured":"Rinnooy Kan, A.H.G. (1976). Machine Scheduling Problems\u2014Classification, Complexity and Computations, Springer US. OCLC: 863792546."},{"key":"ref_20","unstructured":"French, S. (1982). Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop, Wiley."},{"key":"ref_21","unstructured":"Conway, R.W., Maxwell, W.L., and Miller, L.W. (1967). Theory of Scheduling, Courier Corporation."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0305-0548(93)E0016-M","article-title":"Evolution Based Learning in a Job Shop Scheduling Environment","volume":"22","author":"Dorndorf","year":"1995","journal-title":"Comput. Oper. Res."},{"key":"ref_23","unstructured":"Jain, A.S., and Meeran, S. (1998). A State-of-the-Art Review of Job-Shop Scheduling Techniques, University of Dundee. Technical Report."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1287\/opre.8.2.219","article-title":"On the Job-Shop Scheduling Problem","volume":"8","author":"Manne","year":"1960","journal-title":"Oper. Res."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1287\/mnsc.31.5.594","article-title":"Scheduling the General Job-Shop","volume":"31","author":"Barker","year":"1985","journal-title":"Manag. Sci."},{"key":"ref_26","unstructured":"Lawrence, S.R. (1984). Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques (Supplement), Graduate School of Industrial Administration, Carnegie-Mellon University."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","article-title":"The Shifting Bottleneck Procedure for Job Shop Scheduling","volume":"34","author":"Adams","year":"1988","journal-title":"Manag. Sci."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","article-title":"OR-Library: Distributing Test Problems by Electronic Mail","volume":"41","author":"Beasley","year":"1990","journal-title":"J. Oper. Res. Soc."},{"key":"ref_29","unstructured":"Beasley, J.E. (2018, December 01). OR-LIBRARY. Available online: http:\/\/people.brunel.ac.uk\/ mastjjb\/jeb\/info.html."},{"key":"ref_30","unstructured":"Van Hoorn, J. (2018, December 01). Job Shop Instances and Solutions. Available online: http:\/\/jobshop.jjvh.nl\/."},{"key":"ref_31","unstructured":"Shylo, O. (2018, December 01). Job Shop Scheduling. Available online: http:\/\/optimizizer.com\/jobshop.php."},{"key":"ref_32","unstructured":"Tamura, Y. (2018, December 01). JSPLIB: Benchmark Instances for Job-Shop Scheduling Problem. Available online: https:\/\/github.com\/tamy0612\/JSPLIB."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"1425","DOI":"10.1016\/j.jss.2006.09.046","article-title":"Experiences Using Systematic Review Guidelines","volume":"80","author":"Staples","year":"2007","journal-title":"J. Syst. Softw."},{"key":"ref_34","unstructured":"Muth, J.F., and Thompson, G.L. (1963). Probabilistic Learning Combinations of Local Job-Shop Scheduling Rules. Industrial Scheduling, Prentice Hall."},{"key":"ref_35","unstructured":"Muth, J.F., and Thompson, G.L. (1963). Numerical Experience with the Linear and Monte Carlo Algorithms for Solving Production Scheduling Problems. Industrial Scheduling, Prentice Hall."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","article-title":"Benchmarks for Basic Scheduling Problems","volume":"64","author":"Taillard","year":"1993","journal-title":"Eur. J. Oper. Res."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01719250","article-title":"A Generalized Permutation Approach to Job Shop Scheduling with Genetic Algorithms","volume":"17","author":"Bierwirth","year":"1995","journal-title":"Oper.-Res.-Spektrum"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","article-title":"A Fast Taboo Search Algorithm for the Job Shop Problem","volume":"42","author":"Nowicki","year":"1996","journal-title":"Manag. Sci."},{"key":"ref_39","unstructured":"V\u00e1zquez, M., and Whitley, L.D. (2000, January 10\u201312). A Comparison of Genetic Algorithms for the Dynamic Job Shop Scheduling Problem. Proceedings of the 2nd Annual Conference on Genetic and Evolutionary Computation, Las Vegas, NV, USA."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1002\/nav.3800200106","article-title":"On Sequencing with Earliest Starts and Due Dates with Application to Computing Bounds for the (n\/m\/G\/Fmax) Problem","volume":"20","author":"Bratley","year":"1973","journal-title":"Naval Res. Logist. Quart."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0166-218X(94)90204-6","article-title":"A Branch and Bound Algorithm for the Job-Shop Scheduling Problem","volume":"49","author":"Brucker","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1287\/opre.23.3.475","article-title":"On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness","volume":"23","author":"McMahon","year":"1975","journal-title":"Oper. Res."},{"key":"ref_43","unstructured":"Lenstra, J.K. (1976). Sequencing by Enumerative Methods, Mathematisch Centrum. A Revision of Author\u2019s Thesis, Mathematisch Centrum, Amsterdam."},{"key":"ref_44","doi-asserted-by":"crossref","unstructured":"Carlier, J. (1978). Ordonnancements \u00e0 Contraintes Disjonctives. Th\u00e8se de 3\u00e8me cycles. [Ph.D. Thesis, Paris 6 University].","DOI":"10.1051\/ro\/1978120403331"},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1080\/00207549008942766","article-title":"A Comparison of Dispatching Rules for Job Shops with Multiple Identical Jobs and Alternative Routeings","volume":"28","author":"Kim","year":"1990","journal-title":"Int. J. Prod. Res."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"1595","DOI":"10.1080\/00207549008942818","article-title":"Job Shop Scheduling with Alternative Machines","volume":"28","author":"Nasr","year":"1990","journal-title":"Int. J. Prod. Res."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","article-title":"New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling","volume":"38","author":"Storer","year":"1992","journal-title":"Manag. Sci."},{"key":"ref_48","first-page":"283","article-title":"A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems","volume":"2","author":"Yamada","year":"1992","journal-title":"Parallel Proble. Solving Nat."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","article-title":"Job Shop Scheduling by Simulated Annealing","volume":"40","author":"Aarts","year":"1992","journal-title":"Oper. Res."},{"key":"ref_50","unstructured":"Fang, H.L., Ross, P., and Corne, D. (2019, February 18). A Promising Genetic Algorithm Approach to Job-Shop Scheduling, Re-Scheduling and Open-Shop Scheduling Problems. Available online: http:\/\/homepages.inf.ed.ac.uk\/rbf\/MY_DAI_OLD_FTP\/rp623.pdf."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1287\/ijoc.6.2.118","article-title":"A Computational Study of Local Search Algorithms for Job Shop Scheduling","volume":"6","author":"Aarts","year":"1994","journal-title":"ORSA J. Comput."},{"key":"ref_52","unstructured":"Aarts, E.H.L., Van Laarhoven, P.J.M., and Ulder, N.L.J. (1991). Local-Search-Based Algorithms for Job Shop Scheduling, Eindhoven University of Technology. Working Paper."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0377-2217(97)00019-2","article-title":"Benchmarks for Shop Scheduling Problems","volume":"109","author":"Demirkol","year":"1998","journal-title":"Eur. J. Oper. Res."},{"key":"ref_54","unstructured":"Morton, T.E., and Pentico, D. (1993). Heuristic Scheduling Systems: With Applications to Production Systems and Project Management, John Wiley and Sons. [1st ed.]."},{"key":"ref_55","doi-asserted-by":"crossref","unstructured":"V\u00e1zquez, M., and Whitley, L.D. (2000). A Comparison of Genetic Algorithms for the Static Job Shop Scheduling Problem, Springer. Parallel Problem Solving from Nature PPSN VI; Lecture Notes in Computer Science.","DOI":"10.1007\/3-540-45356-3_30"},{"key":"ref_56","unstructured":"Watson, J.P., Barbulescu, L., Howe, A.E., and Whitley, L.D. (1999, January 18\u201322). Algorithm Performance and Problem Structure for Flow-Shop Scheduling. Proceedings of the AAAI-99 Proceedings, American Association for Artificial Intelligence, Orlando, FL, USA."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0167-8191(03)00014-0","article-title":"Parallel GRASP with Path-Relinking for Job Shop Scheduling","volume":"29","author":"Aiex","year":"2003","journal-title":"Parallel Comput."},{"key":"ref_58","doi-asserted-by":"crossref","unstructured":"Chong, C.S., Sivakumar, A.I., Low, M.Y.H., and Gay, K.L. (2006, January 3\u20136). A Bee Colony Optimization Algorithm to Job Shop Scheduling. Proceedings of the 38th Conference on Winter Simulation. Winter Simulation Conference, Monterey, CA, USA.","DOI":"10.1109\/WSC.2006.322980"},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"1539","DOI":"10.1016\/j.apm.2009.09.002","article-title":"Mathematical Models for Job-Shop Scheduling Problems with Routing and Process Plan Flexibility","volume":"34","author":"Yavuz","year":"2010","journal-title":"Appl. Math. Modell."},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10845-007-0026-8","article-title":"Mathematical Modeling and Heuristic Approaches to Flexible Job Shop Scheduling Problems","volume":"18","author":"Fattahi","year":"2007","journal-title":"J. Intell. Manuf."},{"key":"ref_61","doi-asserted-by":"crossref","first-page":"2570","DOI":"10.1080\/00207543.2010.543178","article-title":"Comparisons of Bi-Objective Genetic Algorithms for Hybrid Flowshop Scheduling with Sequence-Dependent Setup Times","volume":"50","author":"Mousavi","year":"2012","journal-title":"Int. J. Prod. Res."},{"key":"ref_62","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01580393","article-title":"A Dual Algorithm for the One-Machine Scheduling Problem","volume":"11","author":"Fisher","year":"1976","journal-title":"Math. Programm."},{"key":"ref_63","doi-asserted-by":"crossref","unstructured":"Stegbauer, C., and H\u00e4u\u00dfling, R. (2010). Graphentheorie. Handbuch Netzwerkforschung, VS Verlag f\u00fcr Sozialwissenschaften.","DOI":"10.1007\/978-3-531-92575-2"},{"key":"ref_64","doi-asserted-by":"crossref","unstructured":"Stegbauer, C., and H\u00e4ussling, R. (2010). Netzwerkforschung. Handbuch Netzwerkforschung, VS Verlag f\u00fcr Sozialwissenschaften. [1st ed.].","DOI":"10.1007\/978-3-531-92575-2"},{"key":"ref_65","first-page":"3","article-title":"Basic Graph Theory: Paths and Circuits","volume":"Volume 1","author":"Graham","year":"1995","journal-title":"Handbook of Combinatorics"},{"key":"ref_66","doi-asserted-by":"crossref","unstructured":"Turau, V. (2009). Algorithmische Graphentheorie, Oldenbourg. OCLC: 467891833; 3, \u00fcberarb, aufl.","DOI":"10.1524\/9783486598520"},{"key":"ref_67","doi-asserted-by":"crossref","unstructured":"Lerner, J. (2010). Beziehungsmatrix. Handbuch Netzwerkforschung, VS Verlag f\u00fcr Sozialwissenschaften.","DOI":"10.1007\/978-3-531-92575-2_32"},{"key":"ref_68","doi-asserted-by":"crossref","unstructured":"Kaderali, F., and Poguntke, W. (1995). Graphen Algorithmen Netze: Grundlagen und Anwendungen in der Nachrichtentechnik, Vieweg.","DOI":"10.1007\/978-3-322-89870-8"},{"key":"ref_69","doi-asserted-by":"crossref","unstructured":"Hohberger, S., and Damlachi, H. (2014). Praxishandbuch Sanierung im Mittelstand, Springer Fachmedien.","DOI":"10.1007\/978-3-658-02063-7"},{"key":"ref_70","first-page":"22","article-title":"Network Structure or Topology","volume":"1","author":"Pandya","year":"2013","journal-title":"Int. J. Adv. Res. Comput. Sci. Manag. Stud."},{"key":"ref_71","unstructured":"Abts, D., and M\u00fclder, W. (2002). Grundkurs Wirtschaftsinformatik: Eine Kompakte und Praxisorientierte Einf\u00fchrung, Springer Vieweg. [9th ed.]."},{"key":"ref_72","doi-asserted-by":"crossref","unstructured":"Ernst, H., Schmidt, J., and Beneken, G.H. (2015). Grundkurs Informatik: Grundlagen und Konzepte f\u00fcr die Erfolgreiche IT-Praxis; Eine Umfassende, Praxisorientierte Einf\u00fchrung, Lehrbuch, Springer Vieweg. [5th ed.]. OCLC: 907482533.","DOI":"10.1007\/978-3-658-01628-9"},{"key":"ref_73","unstructured":"Tanenbaum, A.S., and Wetherall, D.J. (2011). Computer Networks, Pearson Prentice Hall. [5th ed.]. OCLC: ocn660087726."},{"key":"ref_74","unstructured":"Gronau, N., Becker, J., Kliewer, N., Leimeister, J.M., and Overhage, S. (2018). Soziale Netzwerkanalyse. Enzyklop\u00e4die der Wirtschaftsinformatik, GITO. [10th ed.]."},{"key":"ref_75","doi-asserted-by":"crossref","unstructured":"Stegbauer, C. (2008). Soziale Netzwerkanalyse. Handbuch Medienp\u00e4dagogik, VS Verlag f\u00fcr Sozialwissenschaften.","DOI":"10.1007\/978-3-531-91158-8_21"},{"key":"ref_76","doi-asserted-by":"crossref","unstructured":"R\u00fcrup, M., R\u00f6bken, H., Emmerich, M., and Dunkake, I. (2015). Netzwerke im Bildungswesen, Springer Fachmedien Wiesbaden.","DOI":"10.1007\/978-3-658-06737-3"},{"key":"ref_77","first-page":"230","article-title":"A Study on SNA: Measure Average Degree and Average Weighted Degree of Knowledge Diffusion in GEPHI","volume":"7","author":"Ayyappan","year":"2016","journal-title":"Indian J. Comput. Sci. Eng. (IJCSE)"},{"key":"ref_78","unstructured":"Abraham, A. (2012). Bio-Inspired Clustering and Data Diffusion in Machine Social Networks. Computational Social Networks, Springer."},{"key":"ref_79","unstructured":"Barab\u00e1si, A.L., and P\u00f3sfai, M. (2016). Network Science, Cambridge University Press."},{"key":"ref_80","doi-asserted-by":"crossref","unstructured":"Abraham, A. (2012). Social Networks Analysis: Tools, Measures and Visualization. Computational Social Networks: Mining and Visualization, Springer.","DOI":"10.1007\/978-1-4471-4054-2"},{"key":"ref_81","unstructured":"Abraham, A. (2012). Extraction and Analysis of Facebook Friendship Relations. Computational Social Networks: Mining and Visualization, Springer."},{"key":"ref_82","doi-asserted-by":"crossref","unstructured":"Easley, D., and Kleinberg, J. (2010). Networks, Crowds, and Markets: Reasoning about a Highly Connected World, Cambridge University Press.","DOI":"10.1017\/CBO9780511761942"},{"key":"ref_83","first-page":"1291","article-title":"The Empirical Study of a Sna-Based Approach for Identifying KSC of Enterprise","volume":"2","author":"Wu","year":"2015","journal-title":"Chem. Eng. Trans."},{"key":"ref_84","doi-asserted-by":"crossref","unstructured":"Wolf, C., and Best, H. (2010). Clusteranalyse. Handbuch der Sozialwissenschaftlichen Datenanalyse, VS Verlag f\u00fcr Sozialwissenschaften. [1st ed.].","DOI":"10.1007\/978-3-531-92038-2"},{"key":"ref_85","doi-asserted-by":"crossref","unstructured":"Bratley, P., Fox, B.L., and Schrage, L.E. (1987). A Guide to Simulation, Springer. [2nd ed.].","DOI":"10.1007\/978-1-4419-8724-2"},{"key":"ref_86","doi-asserted-by":"crossref","unstructured":"Georgi, G. (1995). Job Shop Scheduling in der Produktion, Wirtschaftswissenschaftliche Beitr\u00e4ge; Physica-Verlag.","DOI":"10.1007\/978-3-642-51530-9"},{"key":"ref_87","unstructured":"Van Hoorn, J. (2018, December 01). Jobshop Explanations. Available online: http:\/\/jobshop.jjvh.nl\/explanation.php."},{"key":"ref_88","unstructured":"Organisation for Economic Co-Operation and Development (2007). OECD Principles and Guidelines for Access to Research Data from Public Funding, OECD Publishing."},{"key":"ref_89","unstructured":"Nicol, A., Caruso, J., and Archambault, E. (2013). Open Data Access Policies and Strategies in the European Research Area and Beyond, European Commission DG Research & Innovation. Technical Report RTD-B6-PP-2011-2."},{"key":"ref_90","unstructured":"Mishra, S. (2015). Concepts of Openness and Open Access, United Nations Educational, Scientific and Cultural Organization."}],"container-title":["Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2306-5729\/4\/1\/32\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:33:02Z","timestamp":1760185982000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2306-5729\/4\/1\/32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,18]]},"references-count":90,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2019,3]]}},"alternative-id":["data4010032"],"URL":"https:\/\/doi.org\/10.3390\/data4010032","relation":{},"ISSN":["2306-5729"],"issn-type":[{"type":"electronic","value":"2306-5729"}],"subject":[],"published":{"date-parts":[[2019,2,18]]}}}