Skip to main content


Journal of Scheduling

Journal of Scheduling OnlineFirst articles


Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity

Tang et al. (Eur J Oper Res 263:401–411, 2017) have recently introduced a parallel-batching machine scheduling problem with linearly deteriorating jobs of two agents and presented a computational complexity classification of various special cases …


Metaheuristics for solving a multi-objective flow shop scheduling problem with sequence-dependent setup times

Industries such as textiles, paints, chemicals, paper, drugs and pharmaceuticals operate as flow shops with sequence-dependent setup times (SDST). The sequence-dependent setup environment is characterised by the dependence of the setup time on the …


Two-machine flow shops with an optimal permutation schedule under a storage constraint

We consider two-machine flow shop scheduling problems with storage to minimize the makespan. Under a storage constraint, each job has its own size, and the total size of the job(s) being processed on the machine(s) and the job(s) waiting for the …

02.04.2019 Open Access

Shop scheduling problems with pliable jobs

In this paper, we study a new type of flow shop and open shop models, which handle so-called “pliable” jobs: their total processing times are given, but individual processing times of operations which make up these jobs are flexible and need to be …


A unified view of parallel machine scheduling with interdependent processing rates

In this paper, we are concerned with the problem of scheduling n jobs on m machines. The job processing rate is interdependent and the jobs are non-preemptive. During the last several decades, a number of related models for parallel machine …

Aktuelle Ausgaben

Über diese Zeitschrift

The Journal of Scheduling provides a global forum for the publication of all forms of scheduling research. It is the only peer reviewed journal with broad coverage of the techniques and applications of scheduling that spans several distinct disciplines.

Readers facing complex scheduling problems can turn to the journal to find the latest advances in the field. Each issue features new and novel techniques, applications, theoretical issues, and innovative approaches to problems. The journal is designed to assist readers in computer science, discrete mathematics, operational research, engineering, management, artificial intelligence, construction, distribution, manufacturing, transportation, aerospace, and retail and service industries.

Officially cited as:

J Sched

Weitere Informationen

Premium Partner