-
A proven optimal result for a benchmark instance of the uncapacitated examination timetabling problem J. Sched. (IF 2.0) Pub Date : 2024-03-11 Angelos Dimitsas, Christos Gogos, Christos Valouxis, Vasileios Nastos, Panayiotis Alefragis
-
A scheduling framework for distributed key-value stores and its application to tail latency minimization J. Sched. (IF 2.0) Pub Date : 2024-02-26 Sonia Ben Mokhtar, Louis-Claude Canon, Anthony Dugois, Loris Marchal, Etienne Rivière
-
A novel and efficient real-time sequencing strategy for appointment scheduling with unpunctual patients J. Sched. (IF 2.0) Pub Date : 2024-02-26
Abstract No-shows and non-punctual appointments have always been uncertain factors faced by managers of service-oriented enterprises and institutions, which usually lead to a low utilization rate of resources and a rapid decline in service satisfaction. Taking clinics as an example, this paper proposes a novel and efficient real-time sequencing strategy to minimize the cost associated with patient
-
Continuity of care in home health care scheduling: a rolling horizon approach J. Sched. (IF 2.0) Pub Date : 2024-01-27 Şeyma Güven-Koçak, Aliza Heching, Pınar Keskinocak, Alejandro Toriello
-
Scheduling the repair and replacement of individual components in operating systems: a bi-objective mathematical optimization model J. Sched. (IF 2.0) Pub Date : 2023-12-21 Gabrijela Obradović, Ann-Brith Strömberg, Kristian Lundberg
-
Multi-neighbourhood simulated annealing for the ITC-2007 capacitated examination timetabling problem J. Sched. (IF 2.0) Pub Date : 2023-12-19
Abstract We propose a multi-neighbourhood simulated annealing algorithm for the ITC-2007 version of the capacitated examination timetabling problem. The proposed solver is based on a combination of existing as well as newly proposed neighbourhoods that better exploit the disconnected structure of the underlying conflict graph and that explicitly deal with the assignment of exams to rooms. We use a
-
The price of anarchy for a berth allocation game J. Sched. (IF 2.0) Pub Date : 2023-11-09 Jiayin Pan, Cong Chen, Yinfeng Xu
-
Improving scheduling in multi-AGV systems by task prediction J. Sched. (IF 2.0) Pub Date : 2023-11-06 Hongkai Fan, Dong Li, Bo Ouyang, Zhi Yan, Yaonan Wang
-
A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing J. Sched. (IF 2.0) Pub Date : 2023-11-06 Frederik Ferid Ostermeier, Jochen Deuse
-
Single-machine primary–secondary scheduling with total tardiness being the primary criterion J. Sched. (IF 2.0) Pub Date : 2023-10-15 Qiulan Zhao, Jinjiang Yuan
We study the single-machine primary–secondary scheduling problems in which the total tardiness is the primary criterion and the secondary criteria are the maximum lateness, the (weighted) number of tardy jobs, and the total weighted tardiness, respectively. These problems are known to be NP-hard, but their exact complexities (strongly NP-hard or pseudo-polynomially solvable) were posed by (in: Pardalos
-
A parallel ruin and recreate heuristic for personnel scheduling in a flexible working environment J. Sched. (IF 2.0) Pub Date : 2023-10-15 Rachid Hassani, Guy Desaulniers, Issmail Elhallaoui
-
Mixed-model moving assembly line material placement optimization for a shorter time-dependent worker walking time J. Sched. (IF 2.0) Pub Date : 2023-09-02 Helmut A. Sedding
-
Scheduling with periodic availability constraints to minimize makespan J. Sched. (IF 2.0) Pub Date : 2023-08-17 Lishi Yu, Zhiyi Tan
-
Block-based state-expanded network models for multi-activity shift scheduling J. Sched. (IF 2.0) Pub Date : 2023-07-22 Michael Römer
-
Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines J. Sched. (IF 2.0) Pub Date : 2023-07-17 Claire Hanen, Alix Munier Kordon
-
The preemptive resource allocation problem J. Sched. (IF 2.0) Pub Date : 2023-06-21 Kanthi Sarpatwar, Baruch Schieber, Hadas Shachnai
We revisit a classical scheduling model to incorporate modern trends in data center networks and cloud services. Addressing some key challenges in the allocation of shared resources to user requests (jobs) in such settings, we consider the following variants of the classic resource allocation problem (RAP). The input to our problems is a set J of jobs and a set M of homogeneous hosts, each has an available
-
Lot streaming for a two-stage assembly system in the presence of handling costs J. Sched. (IF 2.0) Pub Date : 2023-06-08 Niloy J. Mukherjee, Subhash C. Sarin, Daniel A. Neira
-
Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits J. Sched. (IF 2.0) Pub Date : 2023-05-31 Xiaojuan Jiang, Kangbok Lee, Michael L. Pinedo
-
Exact and metaheuristic methods for a real-world examination timetabling problem J. Sched. (IF 2.0) Pub Date : 2023-05-04 Mats Carlsson, Sara Ceschia, Luca Di Gaspero, Rasmus Ørnstrup Mikkelsen, Andrea Schaerf, Thomas Jacob Riis Stidsen
-
An exact solution with an improved running time for the routing flow shop problem with two machines J. Sched. (IF 2.0) Pub Date : 2023-04-30 Ilya Chernykh, Alexander Kononov, Sergey Sevastyanov
-
Dynamic personnel rescheduling: insights and recovery strategies J. Sched. (IF 2.0) Pub Date : 2023-04-29 Broos Maenhout, Mario Vanhoucke
-
Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling J. Sched. (IF 2.0) Pub Date : 2023-04-29 Yannik Zeiträg, José Rui Figueira
-
Preemptive scheduling of parallel jobs of two sizes with controllable processing times J. Sched. (IF 2.0) Pub Date : 2023-04-07 Akiyoshi Shioura, Vitaly A. Strusevich, Natalia V. Shakhlevich
-
Approximating weighted completion time via stronger negative correlation J. Sched. (IF 2.0) Pub Date : 2023-03-30 Alok Baveja, Xiaoran Qu, Aravind Srinivasan
-
Competitive two-agent scheduling with release dates and preemption on a single machine J. Sched. (IF 2.0) Pub Date : 2023-03-27 Shi-Sheng Li, Ren-Xia Chen
-
A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty J. Sched. (IF 2.0) Pub Date : 2023-02-07 François Clautiaux, Boris Detienne, Henri Lefebvre
-
Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms J. Sched. (IF 2.0) Pub Date : 2023-01-25 Fangfang Wu, Zhongyi Jiang, Run Zhang, Xiandong Zhang
-
A note: maximizing the weighted number of Just-in-Time jobs for a given job sequence J. Sched. (IF 2.0) Pub Date : 2023-01-25 Enrique Gerstl, Gur Mosheiov
We study a single machine scheduling problem to maximize the weighted number of Just-in-Time jobs, i.e., jobs which are completed exactly at their due-dates. We focus on the case that the job sequence is given. A pseudo-polynomial solution algorithm has been published for this problem, and we introduce here an efficient polynomial time dynamic programming algorithm. The new algorithm is tested numerically
-
A note on the shifting bottleneck procedure for job shop scheduling J. Sched. (IF 2.0) Pub Date : 2023-01-25 Murat Güngör
-
A multivariate complexity analysis of the material consumption scheduling problem J. Sched. (IF 2.0) Pub Date : 2023-01-14 Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier
-
Single machine scheduling with step-learning J. Sched. (IF 2.0) Pub Date : 2022-12-17 Matan Atsmony, Baruch Mor, Gur Mosheiov
-
Minimizing the expected waiting time of emergency jobs J. Sched. (IF 2.0) Pub Date : 2022-12-12 Arne Schulz, Malte Fliedner
-
Joint replenishment meets scheduling J. Sched. (IF 2.0) Pub Date : 2022-12-08 Péter Györgyi, Tamás Kis, Tímea Tamási, József Békési
-
On the complexity of open shop scheduling with time lags J. Sched. (IF 2.0) Pub Date : 2022-12-05 Wiesław Kubiak
-
Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times J. Sched. (IF 2.0) Pub Date : 2022-11-22 Dvir Shabtay, Baruch Mor
-
Collaborative optimization of workshop layout and scheduling J. Sched. (IF 2.0) Pub Date : 2022-11-17 Yaliang Wang, Xinyu Fan, Chendi Ni, Kanghong Gao, Shousong Jin
-
Well-behaved online load balancing against strategic jobs J. Sched. (IF 2.0) Pub Date : 2022-11-15 Bo Li, Minming Li, Xiaowei Wu
In the online load balancing problem on related machines, we have a set of jobs (with different sizes) arriving online, and the task is to assign each job to a machine immediately upon its arrival, so as to minimize the makespan, i.e., the maximum completion time. In classic mechanism design problems, we assume that the jobs are controlled by selfish agents, with the sizes being their private information
-
How to charge while driving: scheduling point-to-point deliveries of an electric vehicle under overhead wiring J. Sched. (IF 2.0) Pub Date : 2022-11-07 Nils Boysen, Dirk Briskorn, Stefan Schwerdfeger
-
An improved approximation algorithm for a scheduling problem with transporter coordination J. Sched. (IF 2.0) Pub Date : 2022-11-02 Yinling Wang, Xin Han, Yong Zhang, Jacek Blazewicz
-
Parallel solutions for preemptive makespan scheduling on two identical machines J. Sched. (IF 2.0) Pub Date : 2022-10-29 Leah Epstein
We consider online preemptive scheduling of jobs arriving one by one, to be assigned to two identical machines, with the goal of makespan minimization. We study the effect of selecting the best solution out of two independent solutions constructed in parallel in an online fashion. Two cases are analyzed, where one case is purely online, and in the other one jobs are presented sorted by non-increasing
-
Graph representation of the fixed route dial-a-ride problem J. Sched. (IF 2.0) Pub Date : 2022-10-25 Tal Grinshpoun, Elad Shufan, Hagai Ilani, Vadim Levit, Haya Brama
-
Scheduling a pick and place packaging line J. Sched. (IF 2.0) Pub Date : 2022-10-18 Tommaso Schettini, Federico Malucelli, Helena Ramalhinho
-
Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using Inclusion–Exclusion J. Sched. (IF 2.0) Pub Date : 2022-10-18 Olivier Ploton, Vincent T’kindt
-
Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs J. Sched. (IF 2.0) Pub Date : 2022-10-07 Ulrich Pferschy, Julia Resch, Giovanni Righini
-
Optimization of scheduling problems with deterioration effects and an optional maintenance activity J. Sched. (IF 2.0) Pub Date : 2022-10-07 Xinyu Sun, Tao Liu, Xin-Na Geng, Yang Hu, Jing-Xiao Xu
In this investigation, the single-machine scheduling problem with deterioration effects and an optional maintenance activity is explored. Deterioration effect means that the actual processing time of the job is a function of its normal processing time and its starting time. As an optional maintenance activity, the machine will perform a maintenance activity. After the maintenance activity is completed
-
A note on a single-shift days-off scheduling problem with sequence-dependent labor costs J. Sched. (IF 2.0) Pub Date : 2022-10-06 Eiji Mizutani, Kevin Alexander Sánchez Galeano
-
A quest for a fair schedule: The International Young Physicists’ Tournament J. Sched. (IF 2.0) Pub Date : 2022-09-27 Katarína Cechlárová, Ágnes Cseh, Zsuzsanna Jankó, Marián Kireš, Lukáš Miňo
-
Packing-based branch-and-bound for discrete malleable task scheduling J. Sched. (IF 2.0) Pub Date : 2022-09-22 Roland Braune
-
Preemptive and non-preemptive scheduling on two unrelated parallel machines J. Sched. (IF 2.0) Pub Date : 2022-09-21 Alan J. Soper, Vitaly A. Strusevich
-
Equitable scheduling on a single machine J. Sched. (IF 2.0) Pub Date : 2022-09-19 Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
We introduce a natural but seemingly yet unstudied variant of the problem of scheduling jobs on a single machine so as to minimize the number of tardy jobs. The novelty of our new variant lies in simultaneously considering several instances of the problem at once. In particular, we have n clients over a period of m days, where each client has a single job with its own processing time and deadline per
-
Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection J. Sched. (IF 2.0) Pub Date : 2022-09-16 Matan Atsmony, Gur Mosheiov
-
Robust finite-horizon scheduling/rescheduling of operating rooms with elective and emergency surgeries under resource constraints J. Sched. (IF 2.0) Pub Date : 2022-09-13 F. Davarian, J. Behnamian
-
In memoriam Gerhard Woeginger J. Sched. (IF 2.0) Pub Date : 2022-09-11 Jan Karel Lenstra, Franz Rendl, Frits Spieksma, Marc Uetz
-
Simulated annealing with penalization for university course timetabling J. Sched. (IF 2.0) Pub Date : 2022-07-20 Kadri Sylejmani, Edon Gashi, Adrian Ymeri
-
Integrated break and carryover effect minimization J. Sched. (IF 2.0) Pub Date : 2022-06-29 Burak Çavdaroğlu, Tankut Atan
-
Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021 J. Sched. (IF 2.0) Pub Date : 2022-06-28 Roberto Maria Rosati, Matteo Petris, Luca Di Gaspero, Andrea Schaerf
-
Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs J. Sched. (IF 2.0) Pub Date : 2022-06-28 Myungho Lee, Kangbok Lee, Michael Pinedo
-
On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates J. Sched. (IF 2.0) Pub Date : 2022-06-25 Gur Mosheiov, Daniel Oron, Dvir Shabtay
-
A fix-and-optimize heuristic for the ITC2021 sports timetabling problem J. Sched. (IF 2.0) Pub Date : 2022-06-22 George H. G. Fonseca, Túlio A. M. Toffolo
-
Optimal energy scheduling of micro-grids considering the uncertainty of solar and wind renewable resources J. Sched. (IF 2.0) Pub Date : 2022-06-20 Mohammad Ali Taghikhani, Behnam Zangeneh