Journal: Journal of Scheduling
Reordering buffer management with advice
In the reordering buffer management problem, a sequence of colored items arrives at a...
Online interval scheduling with a bounded number of failures
We consider the problem of scheduling intervals on m identical machines where each...
Mathematical models for the berth allocation problem in dry bulk terminals
Port terminals processing large cargo vessels play an important role in bulk material...
Finding an optimal Nash equilibrium to the multi-agent project scheduling problem
Large projects often involve a set of contractors, each in charge of a part of the...
Scheduling cleaning activities on trains by minimizing idle times
We consider a workforce scheduling problem which consists of determining optimal...
Crane scheduling in railway yards: an analysis of computational complexity
An efficient container transfer in railway yards is an important matter to increase...
Offline first-fit decreasing height scheduling of power loads
In this paper, we consider the problem of scheduling energy consumption loads in the...
Non-preemptive buffer management for latency sensitive packets
Naor Joseph (Seffi)
The delivery of latency sensitive packets is a crucial issue in real‐time...
An exact algorithm for parallel machine scheduling with conflicts
We consider an extension of classic parallel machine scheduling where a set of jobs is...
An exact extended formulation for the unrelated parallel machine total weighted completion time problem
The plethora of research on NP ‐hard parallel machine scheduling problems is...
Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
We consider the scheduling problem in which two agents (agents A and B ), each having...
A neighborhood for complex job shop scheduling problems with regular objectives
Due to the limited applicability in practice of the classical job shop scheduling...
Batched bin packing revisited
We revisit the batched bin packing problem. In this model, items come in K consecutive...
Scheduling of multi-class multi-server queueing systems with abandonments
Many real‐world situations involve queueing systems in which customers may...
Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times
We revisit the classic problem of preemptive scheduling on m uniformly related...
Improved approaches to the exact solution of the machine covering problem
For the basic problem of scheduling a set of n independent jobs on a set of m...
Unary NP-hardness of minimizing the number of tardy jobs with deadlines
For single machine scheduling to minimize the number of tardy jobs with deadlines,...
A hybrid multi-objective immune algorithm for predictive and reactive scheduling
The high productivity of a production process has a major impact on the reduction of...
Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations
This paper considers machine scheduling that integrates machine deterioration caused...
A reclaimer scheduling problem arising in coal stockyard management
We study a number of variants of an abstract scheduling problem inspired by the...
Scheduling parallel-machine batch operations to maximize on-time delivery performance
In this paper we study the problem of minimizing total weighted tardiness, a proxy for...
Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime
In 1976, Coffman and Sethi conjectured that a natural extension of LPT list scheduling...
An analysis of the non-preemptive mixed-criticality match-up scheduling problem
Many applications have a mixed‐criticality nature. They contain tasks with a...
High-multiplicity scheduling on one machine with forbidden start and completion times
We are interested in a single machine scheduling problem where jobs can neither start...
Papers per page: