{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T17:15:50Z","timestamp":1725902150937},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319624099"},{"type":"electronic","value":"9783319624105"}],"license":[{"start":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T00:00:00Z","timestamp":1498003200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-62410-5_38","type":"book-chapter","created":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T00:23:02Z","timestamp":1497918182000},"page":"309-317","source":"Crossref","is-referenced-by-count":0,"title":["Automatic Scheduling of Dependency-Based Workflows"],"prefix":"10.1007","author":[{"given":"Tahir","family":"Majeed","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Handschuh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren\u00e9","family":"Meier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,21]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"1. Bektas, T.: The Multiple Traveling Salesman Problem: An Overview of Formulations and Solution Procedures. Omega 34(3), 209\u2013219 (2006)","DOI":"10.1016\/j.omega.2004.10.004"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"2. Chen, J.S., Yan, J.S.: Model Formulations for the Machine Scheduling Problem with Limited Waiting Time Constraints. Journal of Information & Optimization Sciences 27(1), 225\u2013240 (2006)","DOI":"10.1080\/02522667.2006.10699688"},{"key":"38_CR3","unstructured":"3. Gurobi Optimization, I.: Gurobi Optimizer Reference Manual (2017), http:\/\/www.gurobi.com"},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"4. Jain, A.S., Meeran, S.: Deterministic Job-Shop Scheduling: Past, Present and Future. Operational Research 113(2), 390\u2013434 (1998)","DOI":"10.1016\/S0377-2217(98)00113-1"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"5. Kara, I., Derya, T.: Formulations for Minimizing Tour Duration of the Traveling Salesman Problem with Time Windows. In: Procedia Economics and Finance. vol. 26, pp. 1026\u20131034 (2015)","DOI":"10.1016\/S2212-5671(15)00926-0"},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"6. Kek, A.G., Cheu, R.L., Meng, Q.: Distance-Constrained Capacitated Vehicle Routing Problems with Flexible Assignment of Start and End Depots. Mathematical and Computer Modelling 47(1), 140\u2013152 (2008)","DOI":"10.1016\/j.mcm.2007.02.007"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"7. Laporte, G., Nobert, Y.: A Cutting Planes Algorithm for the m-Salesmen Problem. Journal of the Operational Research Society 31(11), 1017\u20131023 (1980)","DOI":"10.1057\/jors.1980.188"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"8. Lawler, E.L., Lenstra, J.K., Kan, A.H.R., Shmoys, D.B.: Sequencing and Scheduling: Algorithms and Complexity. Handbooks in Operations Research and Management Science 4, 445\u2013522 (1993)","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"9. Lee, C.Y., Lei, L., Pinedo, M.: Current Trends in Deterministic Scheduling. Annals of Operations Research 70(0), 1\u201341 (1997)","DOI":"10.1023\/A:1018909801944"},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"10. Manne, A.S.: On the Job-Shop Scheduling Problem. Operations Research 8(2), 219\u2013223 (1960)","DOI":"10.1287\/opre.8.2.219"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"11. Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer Programming Formulation of Traveling Salesman Problems. Journal of the ACM 7(4), 326\u2013329 (1960)","DOI":"10.1145\/321043.321046"},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"12. \u00d6zg\u00fcven, C., \u00d6zbakr, L., Yavuz, Y.: Mathematical Models for Job-Shop Scheduling Problems with Routing and Process Plan Flexibility. Applied Mathematical Modelling 34(6), 1539\u20131548 (2010)","DOI":"10.1016\/j.apm.2009.09.002"},{"key":"38_CR13","doi-asserted-by":"crossref","unstructured":"13. Ronconi, D.P., Birgin, E.G.: Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness, vol. 60, pp. 91\u2013105. Springer (2011)","DOI":"10.1007\/978-1-4614-1123-9_5"},{"key":"38_CR14","doi-asserted-by":"crossref","unstructured":"14. Shapiro, J.F.: Handbooks in Operations Research and Management Science, vol. 4, chap. Mathematical Programming Models and Methods for Production Planning and Scheduling, pp. 371\u2013443. Elsevier (1993)","DOI":"10.1016\/S0927-0507(05)80188-4"},{"key":"38_CR15","doi-asserted-by":"crossref","unstructured":"15. Ta\u015f, D., Gendreaub, M., Jabalic, O., Laporte, G.: The Traveling Salesman Problem with Time-Dependent Service Times. European Journal of Operational Research 248(2), 372\u2013383 (2016)","DOI":"10.1016\/j.ejor.2015.07.048"},{"key":"38_CR16","unstructured":"16. \u0160eda, M.: Mathematical Models of Flow Shop and Job Shop Scheduling Problems. International Journal of Applied Mathematics and Computer Sciences 4(4), 241\u2013246 (2007)"}],"container-title":["Advances in Intelligent Systems and Computing","Distributed Computing and Artificial Intelligence, 14th International Conference"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62410-5_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T05:24:41Z","timestamp":1569475481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-62410-5_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,21]]},"ISBN":["9783319624099","9783319624105"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62410-5_38","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2017,6,21]]}}}