Interval scheduling: A survey
AWJ Kolen, JK Lenstra… - Naval Research …, 2007 - Wiley Online Library
In interval scheduling, not only the processing times of the jobs but also their starting times
are given. This article surveys the area of interval scheduling and presents proofs of results …
are given. This article surveys the area of interval scheduling and presents proofs of results …
Parameterized complexity of machine scheduling: 15 open problems
M Mnich, R Van Bevern - Computers & Operations Research, 2018 - Elsevier
Abstract Machine scheduling problems are a long-time key domain of algorithms and
complexity research. A novel approach to machine scheduling problems are fixed …
complexity research. A novel approach to machine scheduling problems are fixed …
Charging schedule for load peak minimization on large-scale electric bus depots
A Jahic, M Eskander, D Schulz - Applied Sciences, 2019 - mdpi.com
The city of Hamburg has decided to electrify its bus fleets. The two public transportation
companies in this city expect to operate up to 1500 buses by 2030. In order to accomplish …
companies in this city expect to operate up to 1500 buses by 2030. In order to accomplish …
Part feeding at high-variant mixed-model assembly lines
J Golz, R Gujjula, HO Günther, S Rinderer… - Flexible Services and …, 2012 - Springer
The part feeding problem at automotive assembly plants deals with the timely supply of parts
to the designated stations at the assembly line. According to the just-in-time principle, buffer …
to the designated stations at the assembly line. According to the just-in-time principle, buffer …
[HTML][HTML] Two is better than one? Order aggregation in a meal delivery scheduling problem
We address a single-machine scheduling problem motivated by a last-mile-delivery setting
for a food company. Customers place orders, each characterized by a delivery point …
for a food company. Customers place orders, each characterized by a delivery point …
New algorithms for minimizing the weighted number of tardy jobs on a single machine
In this paper we study the classical single machine scheduling problem where the objective
is to minimize the weighted number of tardy jobs. Our analysis focuses on the case where …
is to minimize the weighted number of tardy jobs. Our analysis focuses on the case where …
Single courier single restaurant meal delivery (without routing)
M Cosmi, G Oriolo, V Piccialli, P Ventura - Operations Research Letters, 2019 - Elsevier
We investigate optimization models for meal delivery that do not involve routing. We focus
on the simplest case, with a single restaurant and a single courier, and reduce it to the …
on the simplest case, with a single restaurant and a single courier, and reduce it to the …
Branch-price-and-cut for the mixed capacitated general routing problem with time windows
Abstract The Mixed Capacitated General Routing Problem with Time Windows (MCGRPTW)
is defined over a mixed graph, for which some nodes, arcs and edges have strictly positive …
is defined over a mixed graph, for which some nodes, arcs and edges have strictly positive …
Decision support and optimization in shutdown and turnaround scheduling
N Megow, RH Möhring… - INFORMS Journal on …, 2011 - pubsonline.informs.org
Large-scale maintenance in industrial plants requires the entire shutdown of production
units for disassembly, comprehensive inspection, and renewal. We derive models and …
units for disassembly, comprehensive inspection, and renewal. We derive models and …
Scheduling for last-mile meal-delivery processes
We address a single machine scheduling problem arising in a last mile delivery setting for a
food company. The same problem finds obvious applications also in the context of internal …
food company. The same problem finds obvious applications also in the context of internal …