Economics at your fingertips  

Journal of Scheduling

2016 - 2021

Current editor(s): Edmund Burke and Michael Pinedo

From Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

Access Statistics for this journal.
Track citations for all items by RSS feed
Is something missing from the series or not right? See the RePEc data check for the archive and series.

Volume 24, issue 1, 2021

Editorial: Journal of Scheduling (2020) pp. 1-2 Downloads
Edmund Burke
An integrated rolling horizon approach to increase operating theatre efficiency pp. 3-25 Downloads
Belinda Spratt and Erhan Kozan
New results for scheduling to minimize tardiness on one machine with rejection and related problems pp. 27-34 Downloads
Christos Koulamas and George Steiner
Disruptions in timetables: a case study at Universidade de Lisboa pp. 35-48 Downloads
Alexandre Lemos, Pedro T. Monteiro and Inês Lynce
A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime pp. 49-68 Downloads
Xin Li, José A. Ventura and Kevin A. Bunn
Optimal work-conserving scheduler synthesis for real-time sporadic tasks using supervisory control of timed discrete-event systems pp. 69-82 Downloads
Rajesh Devaraj, Arnab Sarkar and Santosh Biswas
Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs pp. 83-102 Downloads
Michal Penn and Tal Raviv
Measuring the complexity of university timetabling instances pp. 103-121 Downloads
Felipe Rosa-Rivera, Jose I. Nunez-Varela, Cesar A. Puente-Montejano and Sandra E. Nava-Muñoz

Volume 23, issue 6, 2020

Editorial: Dynamic Scheduling Problems pp. 629-630 Downloads
Alessandro Agnetis, Stanisław Gawiejnowicz, Bertrand Miao-Tsong Lin and Gur Mosheiov
Flowshop scheduling with learning effect and job rejection pp. 631-641 Downloads
Baruch Mor, Gur Mosheiov and Dana Shapira
A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times pp. 643-648 Downloads
Nir Halman
Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing pp. 649-664 Downloads
Shaojun Lu, Jun Pei, Xinbao Liu, Xiaofei Qian, Nenad Mladenovic and Panos M. Pardalos
Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects pp. 665-680 Downloads
Alan J. Soper and Vitaly A. Strusevich
Scheduling in data gathering networks with background communications pp. 681-691 Downloads
Joanna Berlińska
Approximation algorithms for energy-efficient scheduling of parallel jobs pp. 693-709 Downloads
Alexander Kononov and Yulia Kovalenko
A periodic optimization approach to dynamic pickup and delivery problems with time windows pp. 711-731 Downloads
Farzaneh Karami, Wim Vancroonenburg and Greet Vanden Berghe
New results for an open time-dependent scheduling problem pp. 733-744 Downloads
Stanisław Gawiejnowicz and Wiesław Kurc
On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty pp. 745-749 Downloads
Yakov Shafransky and Viktor Shinkarevich
Scheduling jobs with a V-shaped time-dependent processing time pp. 751-768 Downloads
Helmut A. Sedding

Volume 23, issue 5, 2020

Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection pp. 525-538 Downloads
Jinwen Ou
A decomposition heuristic for rotational workforce scheduling pp. 539-554 Downloads
Tristan Becker
Dynamic speed scaling minimizing expected energy consumption for real-time tasks pp. 555-574 Downloads
Bruno Gaujal, Alain Girault and Stephan Plassart
Scheduling a proportionate flow shop of batching machines pp. 575-593 Downloads
Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich and Sven O. Krumke
Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments pp. 595-608 Downloads
Jianming Dong, Joshua Chang, Bing Su, Jueliang Hu and Guohui Lin
Serial-batching scheduling with two agents to minimize makespan and maximum cost pp. 609-617 Downloads
Cheng He, Chunqi Xu and Hao Lin
Scheduling two projects with controllable processing times in a single-machine environment pp. 619-628 Downloads
Byung-Cheon Choi and Myoung-Ju Park

Volume 23, issue 4, 2020

On the exact solution of a large class of parallel machine scheduling problems pp. 411-429 Downloads
Teobaldo Bulhões, Ruslan Sadykov, Anand Subramanian and Eduardo Uchoa
An Efficient Filtering Algorithm for the Unary Resource Constraint with Transition Times and Optional Activities pp. 431-449 Downloads
Sascha Cauwelaert, Cyrille Dejemeppe and Pierre Schaus
Interruptible algorithms for multiproblem solving pp. 451-464 Downloads
Spyros Angelopoulos and Alejandro López-Ortiz
Interference aware scheduling of triple-crossover-cranes pp. 465-485 Downloads
Dirk Briskorn and Lennart Zey
Mixed batch scheduling on identical machines pp. 487-496 Downloads
Jun-Qiang Wang, Guo-Qiang Fan and Zhixin Liu
Single-machine scheduling with multi-agents to minimize total weighted late work pp. 497-512 Downloads
Shi-Sheng Li and Jin-Jiang Yuan
Benders decomposition for the mixed no-idle permutation flowshop scheduling problem pp. 513-523 Downloads
Tolga Bektaş, Alper Hamzadayı and Rubén Ruiz

Volume 23, issue 3, 2020

Single machine scheduling to maximize the number of on-time jobs with generalized due-dates pp. 289-299 Downloads
Enrique Gerstl and Gur Mosheiov
Resource-constrained multi-project scheduling: benchmark datasets and decoupled scheduling pp. 301-325 Downloads
Rob Eynde and Mario Vanhoucke
Two-machine flow shops with an optimal permutation schedule under a storage constraint pp. 327-336 Downloads
Yunhong Min, Byung-Cheon Choi and Myoung-Ju Park
Optimizing the physician scheduling problem in a large hospital ward pp. 337-361 Downloads
Renata Mansini and Roberto Zanotti
Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network pp. 363-377 Downloads
Timo Gschwind, Stefan Irnich, Christian Tilk and Simon Emde
The optimal design of round-robin tournaments with three players pp. 379-396 Downloads
Alex Krumer, Reut Megidish and Aner Sela
Evaluating periodic rescheduling policies using a rolling horizon framework in an industrial-scale multipurpose plant pp. 397-410 Downloads
Zachariah Stevenson, Ricardo Fukasawa and Luis Ricardez-Sandoval

Volume 23, issue 2, 2020

An optimal online algorithm for scheduling with general machine cost functions pp. 155-162 Downloads
Islam Akaria and Leah Epstein
The Longest Processing Time rule for identical parallel machines revisited pp. 163-176 Downloads
Federico Della Croce and Rosario Scatamacchia
The flexible break assignment problem for large tour scheduling problems with an application to airport ground handlers pp. 177-209 Downloads
Ferdinand Kiermaier, Markus Frey and Jonathan F. Bard
Broadcasting a file in a communication network pp. 211-232 Downloads
Kai-Simon Goetzmann, Tobias Harks and Max Klimm
A polyhedral study of event-based models for the resource-constrained project scheduling problem pp. 233-251 Downloads
Alexander Tesch
The extended roster quality staffing problem: addressing roster quality variation within a staffing planning period pp. 253-264 Downloads
Komarudin, Tim De Feyter, Marie-Anne Guerry and Greet Vanden Berghe
A diving heuristic for planning and scheduling surgical cases in the operating room department with nurse re-rostering pp. 265-288 Downloads
Babak Akbarzadeh, Ghasem Moslehi, Mohammad Reisi-Nafchi and Broos Maenhout

Volume 23, issue 1, 2020

Journal of scheduling (2020) pp. 1-2 Downloads
Edmund Burke and Michael Pinedo
A review of four decades of time-dependent scheduling: main results, new topics, and open problems pp. 3-47 Downloads
Stanisław Gawiejnowicz
Metaheuristics for solving a multi-objective flow shop scheduling problem with sequence-dependent setup times pp. 49-69 Downloads
V. Anjana, R. Sridharan and P. N. Ram Kumar
A hybrid algorithm for the vehicle routing problem with three-dimensional loading constraints and mixed backhauls pp. 71-93 Downloads
Henriette Koch, Maximilian Schlögell and Andreas Bortfeldt
Minimizing the waiting time for a one-way shuttle service pp. 95-115 Downloads
Laurent Daudet and Frédéric Meunier
Approximation algorithms for the twin robot scheduling problem pp. 117-133 Downloads
Florian Jaehn and Andreas Wiehl
Maximizing the number of jobs scheduled at their baseline starting times in case of machine failures pp. 135-143 Downloads
Philippe Chrétienne
Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines pp. 145-154 Downloads
S. S. Panwalkar and Christos Koulamas
Page updated 2021-03-07