Journal of Scheduling
Издатель: Springer Nature · ISSN 1094-6136,1099-1425 · 24 статей
-
Theoretical lower bounds for a parallel batch scheduling problem
The Oven Scheduling Problem (OSP) is an NP-hard real-world parallel batch scheduling problem arising in the semiconductor industry. Its objective is to schedule a set of jobs on ovens while minimizing total oven runtime, job tardiness,...
-
Near-optimal universal scheduling for moldable tasks: the Fair algorithm
The problem of scheduling moldable tasks on multiprocessor systems with the goal of minimizing the makespan has received significant attention, especially in contexts where tasks have dependence constraints (task graphs) or arrive...
-
A linear-time feasibility checking algorithm based on a difference constraints system for the dial-a-ride problem
The Dial-a-Ride Problem (DARP) is a well-known routing problem in the field of shared mobility systems. In this problem, instead of isolated trips, people share their rides. In addition to the operational constraints, the convenience of...
-
The automated valet parking problem for parking garage service provision
Automated valet parking is a use case for autonomous driving. It allows customers to leave their vehicles at the entrance of a parking garage. The vehicles then independently steer to a parking space. Besides increasing comfort,...
-
Joint resource allocation and adaptive task scheduling in 5G networks using hybrid deep reinforcement with revolution crisscross and quantum supercell optimization
Resource allocation in 5G communication systems is referred to as the process of logically allocating available network resources to end-users, devices, and applications at any point in time in order to provide effective network...
-
Theory and practice of dynamic scheduling problems
This paper opens a special issue of the Journal of Scheduling, devoted to selected papers presented at the Fourth International Workshop on Dynamic Scheduling Problems, held in June 2023 in Winterthur, Switzerland.
-
Schedules for pick-and-place robots
The efficiency of pick-and-place robots that put parts into boxes relies on efficient schedules, which determine the order in which parts are picked. The scheduling problem can be formulated as an integer linear program (ILP). However,...
-
MOSAIC: a multi-satellite collection scheduling solution for large area coverage
Demand for large area coverage is pervasive over a variety of emergency response application domains. Using multiple Earth observation satellites to collect information through image acquisition in efficiently covering such a task is...
-
Improved NSGA-II for the energy-efficient distributed blocking flow shop scheduling problem
In the context of the national carbon peak and carbon neutrality strategies, the green advancement of the manufacturing industry has become a key issue of concern for manufacturing enterprises. This paper takes into account the energy...
-
Online integrated production–transportation in a make-to-order environment
This paper examines an online integrated production and transportation scheduling problem in a make-to-order environment with time-dependent waiting and inventory holding costs. In this problem, the manufacturer has to produce the...
-
Local search and trajectory metaheuristics for the flexible job shop scheduling problem with nonlinear routes and position-based learning
This paper considers the flexible job shop scheduling problem with nonlinear routes, a production environment with a wide range of relevant practical applications, especially in today’s on-demand printing industry. In order to...
-
Single-machine scheduling with rejection and controllable processing times to maximize profit under a makespan constraint
We investigate a variant of the classic knapsack problem in the context of single-machine scheduling with controllable processing times under a makespan constraint. In this problem, the processing time of each job is a bounded linear...
-
Launching drones from a vessel: routing unmanned aerial vehicles from a linearly moving depot
Abstract Unmanned aerial vehicles (or drones) are expected to free urban areas from the negative impacts of traditional last-mile delivery by trucks and vans. To overcome one of the major operational challenges of drones, their limited...
-
Multi-periodic scheduling with release times and deadlines minimizing the number of machine periods
In this paper, a multi-periodic discrete interval scheduling problem is considered. This problem stems from an application to improve customer service in the branch offices of the Internal Revenue Service of Ecuador. A set of jobs must...
-
The effects of congestion in horizontal transport on integrated optimization at an automated container terminal
In automated container terminals, horizontal transport serves as a critical link between quayside operations and yard operations. Once congestion occurs in this segment, it directly disrupts the rhythm of other interconnected...
-
Multi-neighborhood simulated annealing for the multi-activity multi-day shift scheduling problem
This paper addresses the multi-activity multi-day shift scheduling problem with a homogeneous workforce and a quadratic cost function for overstaffing. The objective of this problem is to assign shifts to employees and activities within...
-
Computational complexity and exact techniques for scheduling problems with job prohibitions
In this paper, scheduling problems with job prohibitions are investigated. Here we are given a system of job subsets for positions of machines. For each position of a machine, the subset indicates jobs that can be performed in this...
-
Branch-cut-and-price for open-shop scheduling problems with any regular minsum objective
This paper deals with a general open-shop scheduling problem where jobs have release and due dates, transferring between machines incurs a machine–pair-dependent delay, and any regular objective defined over job completion times is...
-
Just-in-time scheduling with battery constraints
This paper introduces a new scheduling model with a battery constraint to minimize the total rejection cost for non-just-in-time jobs, equivalently, to maximize the weighted number of just-in-time jobs. The battery constraint stipulates...
-
A Tepid-Aware container scheduler for serverless computing environments targeting throughput and energy efficiency
Serverless computing has emerged as a dominant paradigm for deploying scalable, event-driven applications, offering abstraction from infrastructure management. However, despite their advantages, serverless platforms continue to face...
- Prof. Chris Potts, 1949–2026
-
Branching list scheduling algorithms for the identical parallel machine scheduling problem
This paper proposes new heuristics for the classic non-preemptive scheduling problem of assigning n jobs on m identical parallel machines, with the objective of minimizing the makespan. Starting from the list scheduling (LS) method,...
-
Optimally designing chemotherapy scheduling with discrete dosing
Advanced cancer treatment requires the collaboration of highly specialized medical experts in a chain of information-intensive strategies; one way to alleviate this burden and better inform future trials is to build reliable models for...
-
Minimizing maximum late work with optional job rejection on a single machine
In this paper, we study the problem of minimizing the maximum late work with the popular option of job rejection on a single machine. We provide two fundamental properties regarding an optimal schedule, prove that the problem is...