{"type":"ScholarlyArticle","title":"Scheduling Jobs with Stochastic Processing Time on Parallel Identical Machines","authors":[{"name":"Richard Stec","slug":"richard-stec","given":"Richard","family":"Stec","affiliation":"Czech Institute of Informatics, Robotics, and Cybernetics , Czech Technical University in Prague , CZ"},{"name":"Antonin Novak","slug":"antonin-novak","given":"Antonin","family":"Novak","affiliation":"Czech Institute of Informatics, Robotics, and Cybernetics , Czech Technical University in Prague , CZ; Faculty of Electrical Engineering , Czech Technical University in Prague , CZ"},{"name":"Premysl Sucha","slug":"premysl-sucha","given":"Premysl","family":"Sucha","affiliation":"Czech Institute of Informatics, Robotics, and Cybernetics , Czech Technical University in Prague , CZ"},{"name":"Zdenek Hanzalek","slug":"zdenek-hanzalek","given":"Zdenek","family":"Hanzalek","affiliation":"Czech Institute of Informatics, Robotics, and Cybernetics , Czech Technical University in Prague , CZ"}],"abstract":"Many real-world scheduling problems are characterized by uncertain parameters. In this paper, we study a classical parallel machine scheduling problem where the processing time of jobs is given by a normal distribution. The objective is to maximize the probability that jobs are completed before a given common due date. This study focuses on the computational aspect of this problem, and it proposes a Branch-and-Price approach for solving it. The advantage of our method is that it scales very well with the increasing number of machines and is easy to implement. Furthermore, we propose an efficient lower bound heuristics. The experimental results show that our method outperforms the existing approaches.","doi":"10.24963/ijcai.2019/781","url":"https://ijcai.org/proceedings/2019/781","pdf":"https://ijcai.org/proceedings/2019/0781.pdf","markdown":"https://ijcai.org/proceedings/2019/781.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/781","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Planning and Scheduling","track":"Main track","number":781,"pages":{"first":5628,"last":5634},"keywords":["Heuristic Search and Game Playing: Combinatorial Search and Optimisation","Planning and Scheduling: Scheduling"],"videos":[],"references":[{"position":1,"raw":"[Alimoradi et al., 2016] Soroush Alimoradi, Milad Hema- tian, and Ghasem Moslehi. Robust scheduling of parallel machines considering total flow time. Computers & Indus- trial Engineering, 93:152 -161, 2016.","title":"Robust scheduling of parallel machines considering total flow time","authors":"Soroush Alimoradi, Milad Hematian, Ghasem Moslehi","year":"2016","venue":"Computers & Industrial Engineering","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Barnhart et al., 1998] Cynthia Barnhart, Ellis L. Johnson, George L. Nemhauser, Martin W.P. Savelsbergh, and Pamela H. Vance. Branch-and-price: Column generation for solving huge integer programs. Operations research, 46(3):316-329, 1998.","title":"Branch-and-price: Column generation for solving huge integer programs","authors":"Cynthia Barnhart, Ellis L Johnson, George L Nemhauser, Martin W P Savelsbergh, Pamela H Vance","year":"1998","venue":"Operations research","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Chang et al., 2019] Zhiqi Chang, Jian-Ya Ding, and Shiji Song. Distributionally robust scheduling on parallel ma- chines under moment uncertainty. European Journal of Operational Research, 272(3):832 -846, 2019.","title":"Distributionally robust scheduling on parallel machines under moment uncertainty","authors":"Chang","year":"2019","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Daniels and Carrillo, 1997] Richard L. Daniels and Jan- ice E. Carrillo. β-robust scheduling for single-machine systems with uncertain processing times. IIE Transactions, 29(11):977-985, Nov 1997.","title":"β-robust scheduling for single-machine systems with uncertain processing times","authors":"Richard L Daniels, Janice E Carrillo","year":"1997","venue":"IIE Transactions","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Desaulniers et al., 2006] Guy Desaulniers, Jacques Desrosiers, and Marius M. Solomon. Column gen- eration, volume 5. Springer Science & Business Media, 2006.","title":"Column generation","authors":"Guy Desaulniers, Jacques Desrosiers, Marius M Solomon","year":"2006","venue":null,"doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Gleixner et al., 2018] Ambros Gleixner, Michael Bastubbe, Leon Eifler, Tristan Gally, Gerald Gamrath, Robert Lion Gottwald, Gregor Hendel, Christopher Hojny, Thorsten Koch, Marco E. Lübbecke, Stephen J. Maher, Matthias Miltenberger, Benjamin Müller, Marc E. Pfetsch, Chris- tian Puchert, Daniel Rehfeldt, Franziska Schlösser, Christoph Schubert, Felipe Serrano, Yuji Shinano, Jan Merlin Viernickel, Matthias Walter, Fabian Wegschei- der, Jonas T. Witt, and Jakob Witzig. The SCIP Optimiza- tion Suite 6.0. ZIB-Report 18-26, Zuse Institute Berlin, July 2018.","title":"The SCIP Optimization Suite 6.0","authors":"Ambros Gleixner, Michael Bastubbe, Leon Eifler, Tristan Gally, Gerald Gamrath, Lion Robert, Gregor Gottwald, Christopher Hendel, Thorsten Hojny, Marco E Koch, Stephen J Lübbecke, Matthias Maher, Benjamin Miltenberger, Marc E Müller, Christian Pfetsch, Daniel Puchert, Franziska Rehfeldt, Christoph Schlösser, Felipe Schubert, Yuji Serrano, Jan Shinano, Merlin Viernickel, Matthias Walter, Fabian Wegscheider, Jonas T Witt, Jakob Witzig","year":"2018","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Graham et al., 1979] Ronald L. Graham, Eugene L. Lawler, Jan Karel Lenstra, and Alexander H.G.Rinnooy Kan. Op- timization and approximation in deterministic sequencing and scheduling: a survey. In P.L. Hammer, E.L. John- son, and B.H. Korte, editors, Discrete Optimization II, vol- ume 5 of Annals of Discrete Mathematics, pages 287 - 326. Elsevier, 1979.","title":"Optimization and approximation in deterministic sequencing and scheduling: a survey","authors":"Ronald L Graham, Eugene L Lawler, Jan Karel Lenstra, Alexander H G Rinnooy Kan","year":"1979","venue":"Discrete Optimization II","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Gurobi, 2019] Gurobi. Constraints. http://www.gurobi. com/documentation/8.1/refman/constraints.html, 2019. Accessed Februrary 12, 2019.","title":"Gurobi. Constraints","authors":"Gurobi","year":"2019","venue":null,"doi":null,"url":"http://www.gurobi.com/documentation/8.1/refman/constraints.html","internal_url":null},{"position":9,"raw":"[Hamaz et al., 2018] Idir Hamaz, Laurent Houssin, and So- nia Cafieri. A robust basic cyclic scheduling problem. EURO Journal on Computational Optimization, 6(3):291- 313, Sep 2018.","title":"A robust basic cyclic scheduling problem","authors":"Idir Hamaz, Laurent Houssin, Sonia Cafieri","year":"2018","venue":"EURO Journal on Computational Optimization","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Kellerer et al., 2004] Hans Kellerer, Ulrich Pferschy, and David Pisinger. Introduction to np-completeness of knap- sack problems. In Knapsack problems, pages 483-493. Springer, 2004.","title":"Introduction to np-completeness of knapsack problems","authors":"Kellerer","year":"2004","venue":"Knapsack problems","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Lübbecke and Desrosiers, 2005] Marco E. Lübbecke and Jacques Desrosiers. Selected topics in column generation. Operations research, 53(6):1007-1023, 2005.","title":"Selected topics in column generation","authors":"Marco E Lübbecke, Jacques Desrosiers","year":"2005","venue":"Operations research","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Mehta et al., 2007] Neelesh B. Mehta, Jingxian Wu, An- dreas F. Molisch, and Jin Zhang. Approximating a sum of random variables with a lognormal. IEEE Transactions on Wireless Communications, 6(7):2690-2699, July 2007.","title":"Approximating a sum of random variables with a lognormal","authors":"B Neelesh, Jingxian Mehta, Andreas F Wu, Jin Molisch, Zhang","year":"2007","venue":"IEEE Transactions on Wireless Communications","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Morton and Wood, 1998] David P. Morton and R. Kevin Wood. On a stochastic knapsack problem and generaliza- tions. In Advances in computational and stochastic opti- mization, logic programming, and heuristic search, pages 149-168. Springer, 1998.","title":"On a stochastic knapsack problem and generalizations","authors":"David P Morton, R, Kevin Wood","year":"1998","venue":"Advances in computational and stochastic optimization, logic programming, and heuristic search","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Pishevar and Tavakkoi-Moghaddam, 2014] Akram Pishe- var and Reza Tavakkoi-Moghaddam. β -robust parallel machine scheduling with uncertain durations. Universal Journal of Industrial and Business Management, 2(3):69 -74, 2014.","title":"Akram Pishevar and Reza Tavakkoi-Moghaddam. β -robust parallel machine scheduling with uncertain durations","authors":"Tavakkoi-Moghaddam Pishevar","year":"2014","venue":"Universal Journal of Industrial and Business Management","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Ranjbar et al., 2012] Mohammad Ranjbar, Morteza Davari, and Roel Leus. Two branch-and-bound algorithms for the robust parallel machine scheduling problem. Computers & Operations Research, 39(7):1652 -1660, 2012.","title":"Two branch-and-bound algorithms for the robust parallel machine scheduling problem","authors":"Mohammad Ranjbar, Morteza Davari, Roel Leus","year":"2012","venue":"Computers & Operations Research","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Sagnol et al., 2018] Guillaume Sagnol, Christoph Barner, Ralf Borndörfer, Mickaël Grima, Matthes Seeling, Clau- dia Spies, and Klaus Wernecke. Robust allocation of op- erating rooms: A cutting plane approach to handle log- normal case durations. European Journal of Operational Research, 271(2):420 -435, 2018.","title":"Robust allocation of operating rooms: A cutting plane approach to handle lognormal case durations","authors":"Guillaume Sagnol, Christoph Barner, Ralf Borndörfer, Mickaël Grima, Matthes Seeling, Claudia Spies, Klaus Wernecke","year":"2018","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Skutella et al., 2016] Martin Skutella, Maxim Sviridenko, and Marc Uetz. Unrelated machine scheduling with stochastic processing times. Mathematics of operations research, 41(3):851-864, 2016.","title":"Unrelated machine scheduling with stochastic processing times","authors":"Martin Skutella, Maxim Sviridenko, Marc Uetz","year":"2016","venue":"Mathematics of operations research","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Song et al., 2018] Guopeng Song, Daniel Kowalczyk, and Roel Leus. The robust machine availability problem -bin packing under uncertainty. IISE Transactions, 50(11):997-1012, 2018.","title":"The robust machine availability problem -bin packing under uncertainty","authors":"Song","year":"2018","venue":"IISE Transactions","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Wu et al., 2009] Christine Wei Wu, Kenneth N. Brown, and J. Christopher Beck. Scheduling with uncertain durations: Modeling β-robust scheduling with constraints. Comput- ers & Operations Research, 36(8):2348 -2356, 2009.","title":"Scheduling with uncertain durations: Modeling β-robust scheduling with constraints","authors":"Christine Wei Wu, Kenneth N Brown, J Christopher Beck","year":"2009","venue":"Computers & Operations Research","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}