Crama, Yves

Goossens, Dries

Leus, Roel

Marchetti-Spaccamela, Alberto

Schyns, Michaël

Spieksma, Frits

English

Ghent University Academic Bibliography

   Proceedings of the  12th Workshop on Models and Algorithms for Planning and Scheduling Problems   MAPSP 2015 La Roche-en-Ardenne, Belgium 8-12 June 2015   Editors: Alberto Marchetti-Spaccamela, Yves Crama, Dries Goossens, Roel Leus, Michaël Schyns, Frits Spieksma ISBN: 9789081409971     © 2015, KULeuven, Faculty of Business and Economics,  Naamsestraat 69, 3000 Leuven, Belgium  2  Preface      This volume contains abstracts of talks presented at the 12th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2015), held from June 8 to June 12, 2015, in La Roche-en-Ardenne, Belgium.  MAPSP is a biennial workshop dedicated to all theoretical and practical aspects of scheduling, planning, and timetabling. Previous MAPSP meetings have been held in Menaggio, Italy (1993), Wernigerode, Germany (1995), Cambridge, UK (1997), Renesse, Netherlands (1999), Aussois, France (2001), Aussois, France (2003), Siena, Italy (2005), Istanbul, Turkey (2007), Kerkrade, Netherlands (2009), Nymburk, Czech Republic (2011) and Pont à Mousson, France (2013).  The abstracts in this volume include 5 invited talks by Onno Boxma, Michel Goemans, Willem-Jan van Hoeve, Rolf Niedermeier, Stephan Westphal plus 88 contributed talks selected out of 95 submissions.  Each submission was reviewed by at least three program committee members.   Submitted papers are presented in three parallel tracks. It is well known that parallel sessions suffer from the phenomenon that a participant’s favorite talks are scheduled simultaneously in different sessions. In setting up this year’s MAPSP schedule, the organizers, after surveying the participants’ preferences, constructed a schedule that maximizes total attendance and satisfaction.   We thank all sponsors of MAPSP 2015 for their generous support. The conference is  supported by KU Leuven, the University of Liège, Ghent University, the Belgian Science Policy Office (IAP project COMEX), and the Belgian Society for Operations Research (ORBEL). Further, we are very grateful to the companies N-SIDE, OM-PARTNERS,  and ORTEC for sponsoring MAPSP 2015.    We thank the referees, and the members of the organizing committee for making MAPSP 2015 possible.      On behalf of the Program Committee of MAPSP2015,  Alberto Marchetti-Spaccamela (Chair).  3  Contents   Invited contributions  High multiplicity scheduling problems with a constant number of job types are 10 polynomially solvable Prof. Michel Goemans (MIT)   Decision diagrams for optimization and scheduling 11 Prof. Willem-Jan van Hoeve (Tepper School of Business, Carnegie Mellon University)   A parameterized complexity view on scheduling and planning problems 12 Prof. Rolf Niedermeier (TU Berlin)   Asymmetric sports schedules for the German Basketball League 13 Prof. Stephan Westphal (TU Clausthal)    Analysis, optimization and scheduling of polling systems 14 Prof. Onno Boxma (Eindhoven University of Technology)    Submitted contributions   Minimizing maximum flow-time on related machines Nikhil Bansal & Bouke Cloostermans 15-17  On the online machine minimization problem Lin Chen, Nicole Megow & Kevin Schewior 18-20  Improved online algorithms for the machine covering problem with bounded migration  Waldo Gálvez, José A. Soto & José Verschae 21-23  Delay prediction models for robust airline resource scheduling Lucian Ionescu & Natalia Kliewer 24-26  Valid inequalities for a time-indexed formulation Lotte Berghman & Frits Spieksma 27-29  Locks and emissions  Dirk Briskorn, Frits Spieksma & Ward Passchyn 30-32  Scheduling messages to detect patterns continuously on a grid sensor network  Bala Kalyanasundaram & Mahe Velauathapillai 33-36   4  Some positive news on the proportionate open shop problem  Sergey Sevastyanov 37-40  Linearization of directed acyclic graphs on a failure-prone processor  Guillaume Aupy, Anne Benoit, Henri Casanova & Yves Robert 41-43  The optimal absolute ratio for online bin packing  János Balogh, József Békési, György Dósa, Jiří Sgall & Rob van Stee 44-46  Lagrangian duality based algorithms in online scheduling  Nguyen Kim Thang 47-49  Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems   Spyros Angelopoulos, Giorgio Lucarelli & Nguyen Kim Thang 50-52  Decomposition algorithm for the single machine scheduling polytope  Ruben Hoeksma, Bodo Manthey & Marc Uetz 53-55  Scheduling with state-dependent machine speeds  Veerle Timmermans & Tjark Vredeveld 56-58  High multiplicity scheduling with sequencing costs  Michaël Gabay, Alexander Grigoriev, Vincent Kreuzen & Tim Oosterwijk 59-61  Group-dependent models for single machine scheduling with changing processing times and rate-modifying activities Kabir Rustogi & Vitaly Strusevich 62-64  Energy-efficient task execution to cope with timing errors  Aurélien Cavelan, Yves Robert, Hongyang Sun & Frédéric Vivien 65-67  The robust weighted vertex coloring problem with uncertain data  Robert Benkoczi, Ram Dahal & Daya Gaur  68-70  On-line maintenance scheduling Claudio Telha & Mathieu Van Vyve 71-73  Maximum Γ-robust flows over time  Corinna Gottschalk, Arie Koster, Frauke Liers, Britta Peis, Daniel Schmand & Andreas Wierz 74-77  The global EDF scheduling of systems of conditional sporadic DAG tasks Sanjoy Baruah, Vincenzo Bonifaci & Alberto Marchetti-Spaccamela  77-79  Scheduling with time-varying reservation costs  Lin Chen, Nicole Megow, Roman Rischke, Leen Stougie & José Verschae 80-82  5  A cycle breaking approach for the axial 3-dimensional assignment problem with perimeter costs Annette Ficker, Lev Afraimovich & Frits Spieksma 83-85  Star scheduling  Nadia Brauner, Hadrien Cambazard, Benoit Cance, Nicolas Catusse, Pierre Lemaire, Anne-Marie Lagrange & Pascal Rubini 86-88  Scheduling over scenarios on two machines Esteban Feuerstein, Alberto Marchetti-Spaccamela, Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie & Anke van Zuylen 89-91  Unrelated machine scheduling with stochastic processing times  Martin Skutella, Maxim Sviridenko & Marc Uetz 92-94  Interval selection on unrelated machines  Katerina Böhmová, Yann Disser, Enrico Kravina, Matúš Mihalák & Peter Widmayer 95-97  Online non-preemptive scheduling to optimize stretch Pierre Francois Dutot, Erik Saule, Abhinav Srivastav & Denis Trystram 98-100  Flow shop problems with synchronous movement Stefan Waldherr & Sigrid Knust 101-103  Synchronous flow shops with setup times  Stefan Waldherr & Sigrid Knust 104-106  Personalized nurse rostering through linear programming Han Hoogeveen & Tim van Weelden 107-109  Simulation-guided tree search for optimization of PET-CT images acquisition planning  110-112 François Roucoux & Renaud Florquin  Speed scaling with variable electricity rates and speed limits  Antonios Antoniadis, Peter Kling, Sebastian Ott & Sören Riechers 113-115  Semi-online minimum makespan scheduling with restricted assignment Matthias Hellwig & Csanád Imreh 116-118  Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints Sungjin Im, Janardhan Kulkarni & Kamesh Munagala 119-121  The sequential price of anarchy for atomic congestion games  Jasper de Jong & Marc Uetz 122-124  General caching is hard: even for small pages Lukáš Folwarczný & Jiří Sgall 125-127 6   Scheduling fixed tasks while maximizing the minimum idle interval via precoloring extension on unit interval graphs  Guillerme Duvillié, Marin Bougeret & Rodolphe Giroudeau 128-130  Approximation for scheduling on uniform processors with at most one downtime on each machine  Liliana Grigoriu & Donald Friesen 131-133  Model and decomposition algorithm for scheduling the bottling operations line of a large winery Alejandro Mac Cawley 134-136  Fixed sequence integrated production and routing problems  Azeddine Cheref, Alessandro Agnetis, Christian Artigues & Jean-Charles Billaut 137-139  Heuristics for a rich tour scheduling problem in retail  Matthieu Gérard, François Clautiaux & Ruslan Sadykov 140-142  Energy optimization in speed scaling models via submodular optimization Akiyoshi Shioura, Natalia Shakhlevich & Vitaly Strusevich 143-145  Stochastic and robust scheduling in the cloud  Lin Chen, Nicole Megow, Roman Rischke & Leen Stougie 146-148  Packing while traveling Sergey Polyakovskiy & Frank Neumann 149-151  Nearly tight approximability results for minimum biclique cover and partition  Parinya Chalermsook, Sandy Heydrich, Eugenia Holm & Andreas Karrenbauer 152-154  Online multilevel acknowledgment with bounded depth Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukáš Folwarczný, Lukasz Jeż, Nguyen Kim Thang, Jiří Sgall & Pavel Veselý   155-157  Scheduling multipacket frames with frame deadlines  Lukasz Jeż, Yishay Mansour & Boaz Patt-Shamir 158-160  Online deadline scheduling: speed augmentation revisited Nicole Megow & Kevin Schewior 161-163  Online non-clairvoyant scheduling to simultaneously minimize all convex functions  Kyle Fox, Janardhan Kulkarni, Sungjin Im & Benjamin Moseley 164-166  Hallucination Helps: Energy Efficient Virtual Circuit Routing  Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs & Cliff Stein 167-169   7  Approximation algorithms for generalized routing open shop problems  Alexander Kononov & Anna Melnichenko 170-172  Scheduling on a single machine under time-of-use tariffs  Kan Fang, Nelson Uhan, Fu Zhao & John Sutherland 173-175  Scheduling with two non-unit task lengths is NP-complete  Jan Elffers & Mathijs de Weerdt 176-177  Sequential diagnosis of k-out-of-n systems with imperfect tests Wenchao Wei, Kris Coolen, Fabrice Talla Nobibon & Roel Leus 178-180  Staff and machine shift scheduling in a German potash underground mine  Marco Schulze & Jürgen Zimmermann 181-183  An exact algorithm for the chance-constrained resource-constrained project scheduling problem  Patricio Lamas & Erik Demeulemeester 184-186  Colored bin packing: online algorithms and lower bounds  Martin Böhm, György Dósa, Leah Epstein, Jiří Sgall & Pavel Veselý 187-189  Algorithms and lower bounds for online bin stretching Martin Böhm, Jiří Sgall, Rob van Stee & Pavel Veselý 190-192  Online nonpreemptive scheduling for electricity cost in smart grid  Wing-Kai Hon, Hsiang-Hsuan Liu & Prudence Wong 193-195  Scheduling imprecise computations on parallel machines with linear and non-linear error penalties Akiyoshi Shioura, Natalia Shakhlevich & Vitaly Strusevich 196-198  Scheduling tasks to minimize active time on a processor with unlimited capacity Chi Kit Ken Fong, Minming Li, Shi Li, Sheung-Hung Poon, Weiwei Wu & Yingchao Zhao  199-201  On the assignment problem with a nearly monge matrix and its applications in scheduling Christian Weiß, Sigrid Knust, Natalia Shakhlevich & Stefan Waldherr 202-204  Response time analysis for fixed-priority tasks with multiple probabilistic parameters Dorin Maxim & Liliana Cucu-Grosjean 205-207  A branch and price and cut approach for single machine scheduling with raw material availability and setups  Paul Göpfert & Stefan Bock 208-210  8  Shortest path with alternatives for uniform arrival times: algorithms and experiments  Tim Nonner & Marco Laumanns 211-213  Lower bounds on the running time for scheduling and packing problems Lin Chen, Klaus Jansen, Felix Land, Kati Land & Guochuan Zhang 214-216  Non-Preemptive Scheduling with Setup Times  Alexander Mäcker, Manuel Malatyali & Sören Riechers 217-219  On The Power of One Preemption on Uniform Parallel Machines Alan Soper & Vitaly Strusevich 220-222  The a priori traveling repairman problem Martijn van Ee & Rene Sitters 223-225  Optimal scheduling of chemotherapy deliveries under quality of care, resources and ethical constraints  Renaud De Landtsheer, Yoann Guyot, Christophe Ponsard & François Roucoux 226-228  Approximation algorithms for generalized plant location  Alexander Souza 229-231  On the benefits of a hierarchical version of generalized processor sharing Jasper Vanlerberghe, Joris Walraevens, Aditya Jain, Tom Maertens & Herwig Bruneel    232-234  Scheduling of mixed-criticality sporadic task systems with multiple levels Sanjoy Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Suzanne van der Ster & Leen Stougie   235-237  Time-relaxed sport scheduling Dries Goossens & Frits Spieksma 238-240  Coordinating Multi-Job Players in Scheduling Games Fidaa Abed, Jose Correa & Chien-Chung Huang 241-243  Fault tolerant scheduling of non-uniform tasks under resource augmentation  Dariusz Kowalski, Prudence Wong & Elli Zavou 244-246  Active and busy time minimization  Jessica Chang, Samir Khuller & Koyel Mukherjee 247-249  Dominant 1-cycles in circular balanced robotic flow-shops  Florence Thiard, Nicolas Catusse & Nadia Brauner 250-252  Approximability of machine scheduling problems with non-renewable resources  Péter Györgyi & Tamás Kis 253-255  9  University course timetabling with conflict minimization and elective courses Ernst Althaus & Udo Muttray 256-258  Locks, graphs, and intervals  Ward Passchyn, Dirk Briskorn & Frits Spieksma 259-261  Parallel machine scheduling with conflicting jobs: An exact algorithm  Daniel Kowalczyk & Roel Leus 262-264   A tight lower bound for randomized preemptive scheduling with deadlines  Yossi Azar & Oren Gilon 265-267  SelfishMigrate: a scalable algorithm for non-clairvoyantly scheduling heterogeneous processors Sungjin Im, Janardhan Kulkarni, Kamesh Munagala & Kirk Pruhs 268-270  A fully polynomial-time approximation scheme for speed scaling with sleep state  Antonios Antoniadis, Chien-Chung Huang & Sebastian Ott 271-273  On minimizing the number of tardy jobs on the two-machine open shop with common due date Federico Della Croce, Christos Koulamas & Vincent T'Kindt 274-276  Complexity results for robust storage loading problems  Thanh Le Xuan & Sigrid Knust 277-279 

Proceedings of the 12th workshop on models and algorithms for planning and scheduling problems

https://biblio.ugent.be/publication/6919005/file/6919006

Proceedings of the 12th workshop on models and algorithms for planning and scheduling problems

Abstract

Similar works

Full text

Available Versions

Ghent University Academic Bibliography