Cover Image

A stochastic programming approach for the scheduling of medical interpreting service under uncertainty

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ahmed, Abdulaziz, Jebali, Aida
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Task scheduling for autonomous vehicles in the Martian environment
by: Burzyński, Wojciech, et al.
Published: (2024)

An exact approach for the multi-depot electric vehicle scheduling problem
by: Haslinger, Xenia, et al.
Published: (2025)

Approximation algorithms for job scheduling with block-type conflict graphs
by: Furmańczyk, Hanna, et al.
Published: (2022)

On scheduling coupled tasks with exact delays to minimize maximum lateness
by: Kubiak, Wiesław
Published: (2026)

A column-generation approach for an electricity technician routing and scheduling problem with a lexicographic objective
by: Bangerter, Elise, et al.
Published: (2026)

Multi-machine preventative maintenance scheduling with imperfect interventions: a restless bandit approach
by: Ruiz-Hernandez, Diego, et al.
Published: (2024)

Order acceptance and scheduling in capacitated job shops
by: Linß, Florian, et al.
Published: (2024)

A metaheuristic for crew scheduling in a pickup-and-delivery problem with time windows
by: Lucci, Mauro, et al.
Published: (2021)

Compact formulations and valid inequalities for parallel machine scheduling with conflicts
by: Moura, Phablo F. S., et al.
Published: (2023)

A mathematical model for simultaneous personnel shift planning and unrelated parallel machine scheduling
by: Khadivi, Maziyar, et al.
Published: (2024)

Mixed-integer linear programming approaches for nested $p$-center problems with absolute and relative regret objectives
by: Brandstetter, Christof, et al.
Published: (2024)

A Method to Generate Multi-interval Pairwise Compatibility Graphs
by: Hayat, Seemab, et al.
Published: (2024)

Efficient approximation schemes for scheduling on a stochastic number of machines
by: Epstein, Leah, et al.
Published: (2024)

Effective approach of the tridendriform Schroeder tree algebra
by: Catoire, Pierre, et al.
Published: (2026)

On some 2-binomial coefficients of binary words: geometrical interpretation, partitions of integers, and fair words
by: Richomme, Gwenaël
Published: (2025)

Extended formulations for the multilinear polytope of acyclic hypergraphs
by: Del Pia, Alberto, et al.
Published: (2025)

The complete edge relaxation for binary polynomial optimization
by: Del Pia, Alberto, et al.
Published: (2025)

Rank-one Boolean tensor factorization and the multilinear polytope
by: Del Pia, Alberto, et al.
Published: (2022)

Beyond hypergraph acyclicity: limits of tractability for pseudo-Boolean optimization
by: Del Pia, Alberto, et al.
Published: (2024)

The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization
by: Del Pia, Alberto, et al.
Published: (2023)

Counting Tree-Like Multigraphs with a Given Number of Vertices and Multiple Edges
by: Ilyas, Muhammad, et al.
Published: (2025)

On the Convergence of Elementary Cellular Automata under Sequential Update Modes
by: Donoso-Leiva, Isabel, et al.
Published: (2025)

Computing fixed point free automorphisms of graphs
by: Abiad, Aida, et al.
Published: (2026)

A generic Branch-and-Cut algorithm for bi-objective binary linear programs
by: Fouilhoux, Pierre, et al.
Published: (2024)

A study of distributionally robust mixed-integer programming with Wasserstein metric: on the value of incomplete data
by: Ketkov, Sergey S.
Published: (2023)

Reachability in temporal graphs under perturbation
by: Enright, Jessica, et al.
Published: (2024)

Enumeration of Tree-like Multigraphs with a Given Number of Vertices, Self-loops and Multiple Edges
by: Azam, Naveed Ahmed, et al.
Published: (2025)

The Chvátal-Sankoff problem: Understanding random string comparison through stochastic processes
by: Tiskin, Alexander
Published: (2022)

Directed treewidth is closed under taking butterfly minors
by: Kim, Gunwoo, et al.
Published: (2025)

Approximating temporal modularity on graphs of small underlying treewidth
by: Agdur, Vilhelm, et al.
Published: (2025)

Type-B analogue of Bell numbers using Rota's Umbral calculus approach
by: Bagno, Eli, et al.
Published: (2024)

Characterizing traces of processes defined by precedence and response constraints: an order theory approach
by: Dukes, Mark, et al.
Published: (2023)

A distance-free approach to generalized weights
by: Di Giusto, Andrea, et al.
Published: (2025)

The $g$-good-neighbor diagnosability of product networks under the PMC model
by: Wang, Zhao, et al.
Published: (2025)

Trees with maximum $σ$-irregularity under a prescribed maximum degree 6
by: Bašić, Milan
Published: (2026)

Morse Sequences: A simple approach to discrete Morse theory
by: Bertrand, Gilles
Published: (2024)

Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth
by: Foucaud, Florent, et al.
Published: (2025)

Mixed Unit Interval Bigraphs : A Characterization
by: Das, Ashok Kumar, et al.
Published: (2026)

A note on hardness of promise hypergraph colouring
by: Wrochna, Marcin
Published: (2022)

A Formalization of Elementary Linear Algebra: Part I
by: Russinoff, David
Published: (2025)