{"type":"ScholarlyArticle","title":"Scheduling under Uncertainty: A Query-based Approach","authors":[{"name":"Luciana Arantes","slug":"luciana-arantes","given":"Luciana","family":"Arantes","affiliation":"Sorbonne Université , CNRS , Laboratoire d'Informatique de Paris 6 , LIP6 , F-75005 Paris , France"},{"name":"Evripidis Bampis","slug":"evripidis-bampis","given":"Evripidis","family":"Bampis","affiliation":"Sorbonne Université , CNRS , Laboratoire d'Informatique de Paris 6 , LIP6 , F-75005 Paris , France"},{"name":"Alexander Kononov","slug":"alexander-kononov","given":"Alexander","family":"Kononov","affiliation":"Sobolev Institute of Mathematics , Novosibirsk , Russia; Novosibirsk State University , Department of Mechanics and Mathematics , Russia"},{"name":"Manthos Letsios","slug":"manthos-letsios","given":"Manthos","family":"Letsios","affiliation":"Sorbonne Université , CNRS , Laboratoire d'Informatique de Paris 6 , LIP6 , F-75005 Paris , France"},{"name":"Giorgio Lucarelli","slug":"giorgio-lucarelli","given":"Giorgio","family":"Lucarelli","affiliation":"Univ. Grenoble Alpes , CNRS , Inria , Grenoble INP , LIG , 38000 Grenoble , France"},{"name":"Pierre Sens","slug":"pierre-sens","given":"Pierre","family":"Sens","affiliation":"Sorbonne Université , CNRS , Laboratoire d'Informatique de Paris 6 , LIP6 , F-75005 Paris , France"}],"abstract":"We consider a single machine, a set of unit-time jobs, and a set of unit-time errors. We assume that the time-slot at which each error will occur is not known in advance but, for every error, there exists an uncertainty area during which the error will take place. In order to find if the error occurs in a specific time-slot, it is necessary to issue a query to it. In this work, we study two problems: (i) the error-query scheduling problem, whose aim is to reveal enough error-free slots with the minimum number of queries, and (ii) the lexicographic error-query scheduling problem where we seek the earliest error-free slots with the minimum number of queries. We consider both the off-line and the on-line versions of the above problems. In the former, the whole instance and its characteristics are known in advance and we give a polynomial-time algorithm for the error-query scheduling problem. In the latter, the adversary has the power to decide, in an on-line way, the time-slot of appearance for each error. We propose then both lower bounds and algorithms whose competitive ratios asymptotically match these lower bounds.","doi":"10.24963/ijcai.2018/646","url":"https://ijcai.org/proceedings/2018/646","pdf":"https://ijcai.org/proceedings/2018/0646.pdf","markdown":"https://ijcai.org/proceedings/2018/646.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/646","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Planning and Scheduling","track":"Main track","number":646,"pages":{"first":4646,"last":4652},"keywords":["Agent-based and Multi-agent Systems: Resource Allocation","Planning and Scheduling: Planning with Incomplete information","Uncertainty in AI: Nonprobabilistic Models","Planning and Scheduling: Scheduling"],"videos":[],"references":[{"position":1,"raw":"[Alpern and Lidbetter, 2013] Steve Alpern and Thomas Lid- better. Mining coal or finding terrorists: The expand- ing search paradigm. Operations Research, 61:265-279, 2013.","title":"Mining coal or finding terrorists: The expanding search paradigm","authors":"Lidbetter Alpern","year":"2013","venue":"Operations Research","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"Angelopoulos, ] Spyros Angelopoulos. Further connections between contract-scheduling and ray-searching problems. In IJCAI 2015, pages 1516-1522.","title":"Spyros Angelopoulos. Further connections between contract-scheduling and ray-searching problems","authors":"Angelopoulos","year":null,"venue":"IJCAI 2015","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Angelopoulos, 2016] Spyros Angelopoulos. Deterministic searching on the line. In Encyclopedia of Algorithms, pages 531-533. 2016.","title":"Deterministic searching on the line","authors":"Spyros Angelopoulos","year":"2016","venue":"Encyclopedia of Algorithms","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"Benabbou and Perny, a] Nawal Benabbou and Patrice Perny. Adaptive elicitation of preferences under uncer- tainty in sequential decision making problems. In IJCAI 2017, pages 4566-4572.","title":"Adaptive elicitation of preferences under uncertainty in sequential decision making problems","authors":"Perny Benabbou, Patrice Benabbou, Perny","year":null,"venue":"IJCAI 2017","doi":null,"url":null,"internal_url":"/proceedings/2017/637"},{"position":5,"raw":"Benabbou and Perny, b] Nawal Benabbou and Patrice Perny. Incremental weight elicitation for multiobjective state space search. In AAAI 2015, pages 1093-1099.","title":"Incremental weight elicitation for multiobjective state space search","authors":"Perny Benabbou, Patrice Benabbou, Perny","year":null,"venue":"AAAI 2015","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Boutilier et al., 2006] Craig Boutilier, Relu Patrascu, Pas- cal Poupart, and Dale Schuurmans. Constraint-based opti- mization and utility elicitation using the minimax decision criterion. Artif. Intell., 170:686-713, 2006.","title":"Constraint-based optimization and utility elicitation using the minimax decision criterion","authors":"Craig Boutilier, Relu Patrascu, Pascal Poupart, Dale Schuurmans","year":"2006","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Condon et al., 2009] Anne Condon, Amol Deshpande, Lisa Hellerstein, and Ning Wu. Algorithms for distributional and adversarial pipelined filter ordering problems. ACM Trans. Algorithms, 5:24:1-24:34, 2009.","title":"Algorithms for distributional and adversarial pipelined filter ordering problems","authors":"Anne Condon, Amol Deshpande, Lisa Hellerstein, Ning Wu","year":"2009","venue":"ACM Trans. Algorithms","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"Drummond and Boutilier, ] Joanna Drummond and Craig Boutilier. Elicitation and approximately stable matching with partial preferences. In IJCAI 2013, pages 97-105.","title":"Elicitation and approximately stable matching with partial preferences","authors":"Drummond, Joanna Boutilier, Craig Drummond, Boutilier","year":null,"venue":"IJCAI 2013","doi":null,"url":null,"internal_url":"/proceedings/2013/26"},{"position":9,"raw":"Dürr et al., ] Christoph Dürr, Thomas Erlebach, Nicole Megow, and Julie Meißner. Scheduling with explorable uncertainty. In ITCS 2018, pages 30:1-30:14.","title":"Scheduling with explorable uncertainty","authors":"Dürr","year":"2018","venue":"ITCS","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Erlebach and Hoffmann, 2015] Thomas Erlebach and Michael Hoffmann. Query-competitive algorithms for computing with uncertainty. Bulletin of the EATCS, 116, 2015.","title":"Query-competitive algorithms for computing with uncertainty","authors":"Hoffmann Erlebach, Thomas Erlebach, Michael Hoffmann","year":"2015","venue":"Bulletin of the EATCS","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Feder et al., 2003] Tomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, and Jennifer Widom. Computing the median with uncertainty. SIAM J. Comput., 32:538- 547, 2003.","title":"Computing the median with uncertainty","authors":"Tomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom","year":"2003","venue":"SIAM J. Comput","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Feder et al., 2007] Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, and Rina Panigrahy. Comput- ing shortest paths with uncertainty. J. Algorithms, 62:1- 18, 2007.","title":"Computing shortest paths with uncertainty","authors":"Tomás Feder, Rajeev Motwani, O' Liadan, Chris Callaghan, Rina Olston, Panigrahy","year":"2007","venue":"J. Algorithms","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Gelain et al., 2010] Mirco Gelain, Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable, and Toby Walsh. Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies. Artif. Intell., 174:270-294, 2010.","title":"Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies","authors":"Mirco Gelain, Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable, Toby Walsh","year":"2010","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Goerigk et al., 2015] Marc Goerigk, Manoj Gupta, Jonas Ide, Anita Schöbel, and Sandeep Sen. The robust knap- sack problem with queries. Computers & OR, 55:12-22, 2015.","title":"The robust knapsack problem with queries","authors":"Marc Goerigk, Manoj Gupta, Jonas Ide, Anita Schöbel, Sandeep Sen","year":"2015","venue":"Computers & OR","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Gupta et al., 2011] Manoj Gupta, Yogish Sabharwal, and Sandeep Sen. The update complexity of selection and re- lated problems. In FSTTCS, pages 325-338, 2011.","title":"The update complexity of selection and related problems","authors":"Manoj Gupta, Yogish Sabharwal, Sandeep Sen","year":"2011","venue":"FSTTCS","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"Hoffmann et al., ] Michael Hoffmann, Thomas Erlebach, Danny Krizanc, Matús Mihalák, and Rajeev Raman. Com- puting minimum spanning trees with uncertainty. In STACS 2008, pages 277-288.","title":"Computing minimum spanning trees with uncertainty","authors":"Hoffmann","year":null,"venue":"STACS 2008","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"Kahan, ] Simon Kahan. A model for data in motion. In ACM STOC 1991, pages 267-277.","title":"A model for data in motion","authors":"] Kahan, Simon Kahan","year":null,"venue":"ACM STOC 1991","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Megow et al., 2015] Nicole Megow, Julie Meißner, and Martin Skutella. Randomization helps computing a mini- mum spanning tree under uncertainty. In ESA, pages 878- 890, 2015.","title":"Randomization helps computing a minimum spanning tree under uncertainty","authors":"Nicole Megow, Julie Meißner, Martin Skutella","year":"2015","venue":"ESA","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"Olston and Widom, ] Chris Olston and Jennifer Widom. Of- fering a precision-performance tradeoff for aggregation queries over replicated data. In VLDB 2000, pages 144- 155.","title":"Offering a precision-performance tradeoff for aggregation queries over replicated data","authors":"Widom Olston, Chris Olston, Jennifer Widom","year":null,"venue":"VLDB 2000","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}