scheduling

Multi-criteria Course Mode Selection and Classroom Assignment Under Sudden Space Scarcity

  • Mehran Navabi-Shirazi
  • Mohamed El Tonbari
  • Natashia Boland
  • Dima Nazzal
  • Lauren Steimle
    • Categories Applications - OR and Management Sciences, Multi-Criteria Optimization, Scheduling Tags , , , ,

    Problem Definition: While physical (or ‘social’) distancing is an important public health intervention during airborne pandemics, physical distancing dramatically reduces the effective capacity of classrooms. During the COVID-19 pandemic, this presented a unique problem to campus planners who hoped to deliver a meaningful amount of in-person instruction in a way that respected physical distancing. This … Read more

    A MILP Approach to DRAM Access Worst-Case Analysis

  • Matteo Andreozzi
  • Antonio Frangioni
  • Laura Galli
  • Giovanni Stea
  • Raffaele Zippo
    • Categories (Mixed) Integer Linear Programming, Branch and Cut Algorithms, Scheduling Tags , , ,

    The Dynamic Random Access Memory (DRAM) is among the major points of contention in multi-core systems. We consider a challenging optimization problem arising in worst-case performance analysis of systems architectures: computing the worst-case delay (WCD) experienced when accessing the DRAM due to the interference of contending requests. The WCD is a crucial input for micro-architectural … Read more

    Scheduling the Brazilian OR Conference

  • Teobaldo Bulhões
  • Puca Huachi V. Penna
  • Anand Subramanian
  • Rubens Correia
    • Categories Meta Heuristics, Scheduling Tags , ,

    In this paper, we show how to efficiently schedule the Brazilian OR conference using a matheuristic approach. The event has traditionally around 300 presentations across a period of 3 to 4 days, and building a schedule for the technical sessions is an arduous task. The proposed algorithm integrates the concepts of iterated local search and … Read more

    On Recognizing Staircase Compatibility

  • Andreas Bärmann
  • Maximilian Merkert
  • Patrick Gemander
  • Alexander Martin
    • Categories 0-1 Programming, Graphs and Matroids, Scheduling Tags , , ,

    For the problem to find an m-clique in an m-partite graph, staircase compatibility has recently been introduced as a polynomial-time solvable special case. It is a property of a graph together with an m-partition of the vertex set and total orders on each subset of the partition. In optimization problems involving m-cliques in m-partite graphs … Read more

    Conference scheduling: a clustering-based approach

  • Teobaldo Bulhões
  • Anand Subramanian
  • Rubens Correia
    • Categories Integer Programming, Scheduling Tags , ,

    Scheduling the technical sessions of scientific events is an arduous task commonly faced by many organizers worldwide. Due the particularities of each conference, there is no consensus regarding the problem definition, and researchers have tackled each specific case individually. Despite their distinct characteristics, one often expects the sessions to be composed of presentations of similar … Read more

    Sufficient condition on Schrage conjecture about the completion time variance

  • Rabia Nessah
    • Categories Applications - OR and Management Sciences Tags , ,

    We consider a single machine scheduling problem to minimize the completion time variance. This roblem is known to be NP-hard. We prove that if $p_{n-1} = p_{n-2$, then there is an optimal solution of the form $(n,n-2,n-3,…,n-4,n-1)$. A new lower bound are proposed for solving the problem. The test on more than 4000 instances shows … Read more

    Mixed-Integer Linear Programming for Scheduling Unconventional Oil Field Development

  • Jeff Linderoth
  • James R. Luedtke
  • Fabian Rigterink
  • Akhilesh Soni
    • Categories Scheduling Tags , , ,

    The scheduling of drilling and hydraulic fracturing of wells in an unconventional oil field plays an important role in the profitability of the field. A key challenge arising in this problem is the requirement that neither drilling nor oil production can be done at wells within a specified neighborhood of a well being fractured. We … 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

    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

    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