Skip to main content


Journal of Scheduling

Journal of Scheduling OnlineFirst articles


Scheduling computations with provably low synchronization overheads

We present a Work Stealing scheduling algorithm that provably avoids most synchronization overheads by keeping processors’ deques entirely private by default and only exposing work when requested by thieves. This is the first paper that obtains …

17-10-2021 Open Access

Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times

We consider in this work a bicriteria scheduling problem on two different parallel machines with a periodic preventive maintenance policy. The two objectives considered involve minimization of job rejection costs and weighted sum of completion …

15-10-2021 Open Access

Twin-crane scheduling during seaside workload peaks with a dedicated handshake area

To enable the efficient division of labor in container yards, many large ports apply twin cranes, two identical automated stacking cranes each dedicated to one of the transfer zones on the seaside and landside. The use of a handshake area, a bay …

01-10-2021 Open Access

Column generation for minimizing total completion time in a parallel-batching environment

This paper deals with the $$1|{p-\text {batch}, s_j\le b}|\sum C_j$$ 1 | p - batch , s j ≤ b | ∑ C j scheduling problem, where jobs are scheduled in batches on a single machine in order to minimize the total completion time. A size is given for …

21-09-2021 Open Access

Optimally rescheduling jobs with a Last-In-First-Out buffer

This paper considers single-machine scheduling problems in which a given solution, i.e., an ordered set of jobs, has to be improved as much as possible by re-sequencing the jobs. The need for rescheduling may arise in different contexts, e.g., due …

Current Publications

About this journal

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

Additional information

Premium Partner

    Image Credits