Scheduling

Logic-based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling

  • Dionne M. Aleman
  • Merve Bodur
  • Cheng Guo
  • David R. Urbach
    • Categories Cutting Plane Approaches, Scheduling, Stochastic Programming

    The distributed operating room (OR) scheduling problem aims to find an assignment of surgeries to ORs across collaborating hospitals that share their waiting lists and ORs. We propose a stochastic extension of this problem where surgery durations are considered to be uncertain. In order to obtain solutions for the challenging stochastic model, we use sample … Read more

    Dynamic Design Of Reserve Crew Duties For Long Haul Airline Crew

  • Richard Janssen
  • Bruno F. Santos
  • Lennart Scherp
    • Categories Airline Optimization, Applications - OR and Management Sciences, Scheduling

    Airlines need crew to operate their flights. In case of crew unavailability, for example due to illness, the airline often uses reserve crew to still be able to operate the flight. In this paper, we apply a simulation-based optimization method to determine how much and on which days reserve crew needs to be scheduled. This … Read more

    Migration from Sequence to Schedule in Total Earliness and Tardiness Scheduling Problem

  • Mohammad Mahdavi Mazdeh
  • Mohammad Namakshenas
    • Categories Scheduling Tags , , ,

    Services must be delivered with high punctuality to be competitive. The classical scheduling theory offers to minimize the total earliness and tardiness of jobs to deliver punctual services. In this study, we developed a fully polynomial-time optimal algorithm to transform a given sequence, the permutation of jobs, into its corresponding minimum cost schedule, the timing … Read more

    Data-Driven Distributionally Robust Appointment Scheduling over Wasserstein Balls

  • Ruiwei Jiang
  • Minseok Ryu
  • Guanglin Xu
    • Categories Robust Optimization, Scheduling, Stochastic Programming

    We study a single-server appointment scheduling problem with a fixed sequence of appointments, for which we must determine the arrival time for each appointment. We specifically examine two stochastic models. In the first model, we assume that all appointees show up at the scheduled arrival times yet their service durations are random. In the second … Read more

    Minimizing Total Earliness and Tardiness with Periodically Supplied Non-renewable Resource Profiles

  • Aleida Braaksma
  • Mohammad Mahdavi Mazdeh
  • Mohammad Namakshenas
    • Categories Approximation Algorithms, Scheduling Tags , , ,

    We consider a special class of resource-constrained single machine scheduling problems. In the classical scheduling context, resource types are classi ed into renewable and non-renewable; however, a large variety of real-world problems may not fit into one of these classes, e.g., labor regulations in project scheduling, budget allocation to different phases of a construction project, and … Read more

    A Solution Approach to Distributionally Robust Chance-Constrained Assignment Problems

  • Jinlin Li
  • Sanjay Mehrotra
  • Shanshan Wang
    • Categories Applications - OR and Management Sciences, Branch and Cut Algorithms, Scheduling

    We study assignment problem with chance constraints (CAP) and its distributionally robust counterpart (DR-CAP). We present a technique for estimating big-M in such a formulation that takes advantage of the ambiguity set. We consider a 0-1 bilinear knapsack set to develop valid inequalities for CAP and DR-CAP. This is generalized to the joint chance constraint … Read more

    Planning Out-of-Hours Services for Pharmacies

  • Christina Büsing
  • Arie M.C.A. Koster
  • Timo Gersing
    • Categories 0-1 Programming, Applications - OR and Management Sciences, Scheduling Tags , , , , ,

    The supply of pharmaceuticals is one important factor in a functioning health care system. In the German health care system, the chambers of pharmacists are legally obliged to ensure that every resident can find an open pharmacy at any day and night time within an appropriate distance. To that end, the chambers of pharmacists create … Read more

    A Robust Optimization Approach for the Unrelated Parallel Machine Scheduling Problem

  • Jonathan De La Vega
  • Reinaldo Morabito
  • Pedro Munari
  • Alfredo Moreno
    • Categories Applications - OR and Management Sciences, Scheduling

    In this paper, we address the Unrelated Parallel Machine Scheduling Problem (UPMSP) with sequence- and machine-dependent setup times and job due-date constraints. Different uncertainties are typically involved in real-world production planning and scheduling problems. If ignored, they can lead to suboptimal or even infeasible schedules. To avoid this, we present two new robust optimization models … Read more

    A Framework for Peak Shaving Through the Coordination of Smart Homes

  • Miguel F. Anjos
  • Michael David de Souza Dutra
  • Sébastien Le Digabel
    • Categories (Mixed) Integer Linear Programming, Energy, Scheduling

    In demand–response programs, aggregators balance the needs of generation companies and end-users. This work proposes a two-phase framework that shaves the aggregated peak loads while maintaining the desired comfort level for users. In the first phase, the users determine their planned consumption. For the second phase, we develop a bilevel model with mixed-integer variables and … Read more

    Scheduling jobs with a V-shaped time-dependent processing time

  • Helmut Sedding
    • Categories Approximation Algorithms, Scheduling

    In the field of time-dependent scheduling, a job’s processing time is specified by a function of its start time. While monotonic processing time functions are well-known in the literature, this paper introduces non-monotonic functions with a convex, piecewise-linear V-shape similar to the absolute value function. They are minimum at an ideal start time, which is … Read more