header-frame
alternative
alternative
MAPSP - Workshop on Models and Algorithms for Planning and Scheduling Problems
is a biennial workshop dedicated to all theoretical and practical aspects of scheduling, planning, and timetabling. The 15th Edition (MAPSP 2022) will be organized in Oropa Sanctuary, Oropa (Biella), Italy. It will take place in the week of 12-17 June 2022.
The Location

The Oropa Sanctuary

The Oropa Sanctuary is located in the Alps in North-Western Italy in a unique, natural and unspoilt setting at 1200 mt. a.m.s.l at a distance of 90 km from Turin and 120 km from Milan. Lodging facilities and restaurants are all within walking distance from the Sanctuary

The Sanctuary of Oropa (Italian: santuario di Oropa), is a group of Roman Catholic buildings and structures in Biella, Italy. It is located at a height of 1,159 metres in a small valley of the Alpi Biellesi.

  • The mountain area surrounding the sanctuary is included in a regional park of 1,518.28
Sanctuary Website

Getting There

The Sanctuary is roughly 90 km away from Turin and 120 km away from Milan

  • We recommend to land in Torino's airport
Bus services provided by the organizers We plan to organize a couple of buses from the railway station of Biella to Oropa for sunday afternoon (same for the departure on friday 17). The relevant railway station name is S. Paolo. The conference-reserved bus schedule is as follows:
12th of June
Departures from the train Station of Biella "San Paolo" to Santuario di Oropa: 4.30pm - 5.30pm - 6.30pm

17th of June
Departures from the Santuario Oropa to the train Station of Biella "San Paolo": Please, book your seats on the following outbound busses at the conference's front desk. 12.00pm - 1.45pm - 3.00pm

To reach Biella, if you fly to Torino (Milano), you need to go to Torino (Milano) railway station and then pick the local train to Biella. It will take about 1h 15 min from Torino and 2 hours from Milano. If you arrive on your own, please refer to the timetable of bus 360 --- Bus 360 on MoovitApp





Accomodation

Lodging facilities and restaurants are all within walking distance from the Sanctuary.
Accomodation at the Santuario can be reserved by sending an email to info@santuariodioropa.it mentioning mapsp2022 Conference, your name and the arrival and departure dates.

Alternatively you may go to the Santuario website here and fill the relevant form mentioning in the message that you participate to mapsp2022.

Approximately 100 rooms have been reserved for the Conference until the 30th of April 2022. After that date, you will need to directly contact the Santuario.

The following daily rooms costs are available Room M. Mucrone (Comfort): single occupancy €52 plus €6.5 for breakfast
Room M. Mucrone (Comfort): double occupancy €63 plus €13 for breakfast
Room Montis Oropae (Junior Suites and Suites): single occupancy €83 plus €6.5 for breakfast
Room Montis Oropae (Junior Suites and Suites): double occupancy €100 plus €13 for breakfast

Important: the local office typically closes around 6-6.30pm. If possible, foresee an arrival not later than 6pm. Alternatively, please advise the Santuario accomodation office.

Program Committee (PC)

  • Leah Epstein (University of Haifa, Israel – PC chair)
  • Janos Balogh (University of Szeged, Hungary)
  • Jozsef Bekesi (University of Szeged , Hungary)
  • Janka Chlebikova (University of Portsmouth, UK)
  • Federico Della Croce (Politecnico di Torino, Italy)
  • Franziska Eberle (London School of Economics, UK)
  • Alexander Grigoriev (Maastricht University, The Netherlands)
  • Peter Gyorgyi (SZTAKI, Hungary)
  • Sven Jager (Fraunhofer Institute for Industrial Mathematics, Germany)
  • Luksaz Jez (University of Wroclaw, Poland)
  • Shahin Kamali (University of Manitoba, Canada)
  • Dusan Knop (Czech Technical University in Prague, Czech Republic)
  • Marten Maack (Paderborn University, Germany)
  • Chris Schwiegelshohn (Aarhus University, Denmark)
  • Dvir Shabtay (Ben-Gurion University of the Negev, Israel)
  • Tami Tamir (Reichman University, Israel)

Organizing Committee

  • Federico Della Croce (Chair, Politecnico di Torino, Italy)
  • Roberto Bargetto (Politecnico di Torino, Italy)
  • Gabriele Dragotto (Polytechnique Montréal, Canada)
  • Alessandro Druetto (Università di Torino, Italy)
  • Marco Ghirardi (Politecnico di Torino, Italy)
  • Andrea Grosso (Università di Torino, Italy)
  • Giuseppe Lancia (Università di Udine, Italy)
  • Elena Rener (Politecnico di Torino, Italy)
  • Fabio Salassa (Politecnico di Torino, Italy)
  • Rosario Scatamacchia (Politecnico di Torino, Italy)

Invited Speakers

Alessandro Agnetis

Università di Siena, Dipartimento di Ingegneria dell'Informazione e Scienze Matematiche
Scheduling machines subject to unrecoverable failures and other related stochastic sequencing problems

Download slides

Consider the following basic setting. A set of n jobs has to be performed on a set of parallel, identical machines. Unlike most scheduling situations, machines may actually fail, i.e., while performing a job i, they can become unavailable (e.g. break down) with probability \pi_i. Such failures are unrecoverable, in the sense that from then onwards the machine is lost and so are the jobs not yet processed on that machine. If a job i is successfully completed, a reward r_i is attained. The problem is how to assign the jobs to the machines and sequence them so that the expected reward is maximized. In this talk we review the main results, discuss relationships with other sequencing problems and point out some open problems. While the single-machine case is easy, for two or more machines the problem is hard and various approaches have been proposed to address it. For general m, list scheduling yields a 0.8531-approximate solution. The argument is similar to the one used by Schwiegelshohn to prove Kawaguchi and Kyan's bound for the minimization of total weighted completion time. A variant of this problem is attained if, in order to hedge against failures, we can use job replication. In this case, copies of the same job can be scheduled on different machines, and the reward r_i is attained if at least one copy is successfully completed. In this case, the sequence of the n copies of the jobs on each machine has to be decided. Although also this problem is hard for m>=2, relatively simple algorithms provide solutions which are provably close to optimality. A related sequencing problem is the following. A system consists of n components, each of which can be either functioning or not. Only if all components are functioning, the system is "up". Component i is functioning with probability \pi_i, and testing it costs c_i. As soon as a component that is not functioning is detected, the testing stops (concluding that the system is "down"). The problem is to decide in which order should the components be tested, in order to minimize the expected costs. While the single-tester problem is solved by a simple priority rule, various problem variants can be considered. In particular, if several testers operate in parallel, under time constraints, the problem gets more complicated. While it is NP-hard for three or more testers, its complexity with two testers is still open.


Thomas Erlebach

University of Durham, United Kingdom
Explorable Uncertainty and Untrusted Predictions

Download slides

The research area of explorable uncertainty is concerned with problems where some of the input data is uncertain, but queries can be executed to reveal the true values of uncertain input elements. Uncertain values are typically given in the form of intervals. The goal is to minmise the number of queries that are needed until a provably correct solution can be output. In addition to the intervals, we may have access to predictions of the true values, possibly obtained via machine learning. Our aim is then to devise query strategies that benefit from accurate predictions but do not get misled too much by incorrect predictions. In this talk, we will discuss some recent progress in this combined setting, including query strategies for minimum spanning trees with edge uncertainty that benefit from good predictions while maintaining the best possible worst-case competitive ratio even if the predictions are arbitrarily wrong. (The talk is mainly based on joint work with Murilo Santos de Lima, Nicole Megow and Jens Schlöter.)

Lene Monrad Favrholdt

University of Southern Denmark, Odense, Denmark
Paging and Packing with Possibly Precise Predictions

Download slides

The talk will survey techniques for designing and analyzing online algorithms with predictions, advice as well as possibly imprecise predictions. Online problems with predictions relate to semi-online problems in that some information is available which would not be available to a purely online algorithm. In the advice as well as the semi-online setting, this additional information is usually exact. In the semi-online setting, some emphasis is put on the information being realistically obtainable, whereas in the advice setting, the focus is on minimizing the amount of information communicated to the algorithm. In online problems with predictions, the concern is how well the algorithm adapts to errors in the information and the information should preferably be learnable. The running example will be the paging problem, but we will also consider packing problems such as knapsack and bin packing.


Alberto Marchetti Spaccamela

Università di Roma La Sapienza, Dipartimento di Ingegneria informatica automatica e gestionale
Scheduling DAGs: recent results and challenges


Download slides

Multi-core architectures are nowadays widely used for their increased performance over single-core processors. To take full advantage of these architectures we must exploit intra-task parallelism. The Directed Acyclic Graph (DAGs) is a popular representation to describe the structure of parallel applications and to model the execution of multi-threaded programs that is widely used in cloud computing and in real-time systems. In this talk I will present recent results on DAG scheduling considering different models and focusing on complexity, approximation and integer linear program representations.


Call for Papers

MAPSP is a biennial workshop dedicated to all theoretical and practical aspects of scheduling, planning, and timetabling. The 15th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2022) will be organized in Oropa Sanctuary, Oropa (Biella), Italy.
It will take place in the week of 12-17 June 2022. The Oropa Sanctuary is located in the Alps in North-Western Italy in a unique, natural and unspoilt setting at 1200 mt. a.m.s.l at a distance of 90 km from Turin and 120 km from Milan. Lodging facilities and restaurants are all within walking distance from the Sanctuary. The current plan is for the workshop to be on-location only, with no possibility for remote participation.

Abstracts of 2-3 pages must be submitted using EasyChair using the MAPSP LaTeX template EasyChair Submission Link: click here
MAPSP LaTeX Template: click here

Please remember to specify the speaker in the abstract. MAPSP has a firm policy of only one talk per person.


Important Dates

Submissions deadline: February 5 February 10, 2022
Notification: February 27, 2022
Early registration deadline: March 25 April 15, 2022
Workshop: June 12-17, 2022

Accepted Papers

The list of accepted papers is available here.

Proceedings

The proceedings are available here.

Workshop Registration

Workshop fee (including lunches Monday-Friday and dinners Sunday-Thursday):
Early registration fee (until March 25 April 30, 2022): 400 Euro
Late registration fee (from March 26 May 1, 2022): 500 Euro
Accompanying person fee: 300 Euro

Registration Form


Use the registration form here to register for the conference.
After completing this registration form, please transfer the conference fee via bank transfer to the account below.

Bank transfer details


Account Name: COMITATO ORGANIZZATORE CONFERENZA MAPSP2022
Beneficiary Address: CSO DUCA DEGLI ABRUZZI 24, 10129 Torino, Italy
Bank Name: UNICREDIT
Bank Branch Address: C/O Politecnico Via D’Ovidio, 6, 10129 Torino, Italy
IBAN code: IT91S0200801160000106376437
SWIFT/BIC: UNCRITM1AG0
Body: Registration Fee "Participant NAME SURNAME"

Note: if your bank requires an account code, this can be read from the IBAN (000106376437)
Please make sure your fee payment includes any bank transfer expenses, and send us a copy of your bank transfer to mapsp2022@polito.it.
You will get a receipt in the following days.
CANCELLATION: In case of cancellation, the registration fee will not be refunded after May 29th, 2022.

Workshop Schedule

The detailed pdf schedule is available here.

Responsive image
footer-frame