Springer
Journal of Scheduling
Order information:
Web: http://www.springer.com/journal/10951
Download restrictions: Access to the full text of the articles in this series is restricted.
Editor:
Editor:
For corrections or technical questions regarding this series, please contact (Sonal Shukla) or (Rebekah McClure)
Series handle: repec:spr:jsched
ISSN: 1099-1425
Citations RSS feed: at CitEc
Top item:
ISSN: 1099-1425
Citations RSS feed: at CitEc
Impact factors
- Simple (last 10 years)
- Recursive (10)
- Discounted (10)
- Recursive discounted (10)
- H-Index (10)
- Euclid (10)
- Aggregate (10)
Top item:
- By citations
- By downloads (last 12 months)
June 2017, Volume 20, Issue 3
- 219-237 Continuous-time production, distribution and financial planning with periodic liquidity balancing
by Wolfgang Albrecht & Martin Steinrücke - 239-254 The local–global conjecture for scheduling with non-linear cost
by Nikhil Bansal & Christoph Dürr & Nguyen Kim Thang & Óscar C. Vásquez - 255-265 A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
by René Bevern & Rolf Niedermeier & Ondřej Suchý - 267-277 Optimal scheduling of contract algorithms with soft deadlines
by Spyros Angelopoulos & Alejandro López-Ortiz & Angèle Hamel - 279-292 A greedy approximation algorithm for minimum-gap scheduling
by Marek Chrobak & Uriel Feige & Mohammad Taghi Hajiaghayi & Sanjeev Khanna & Fei Li & Seffi Naor - 293-302 Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence
by Bertrand M. T. Lin & F. J. Hwang & Jatinder N. D. Gupta - 303-311 The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays
by Aurélien Carlier & Claire Hanen & Alix Munier Kordon
April 2017, Volume 20, Issue 2
- 115-127 Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times
by Leah Epstein & Ido Yatsiv - 129-145 Scheduling of multi-class multi-server queueing systems with abandonments
by Urtzi Ayesta & Peter Jacko & Vladimir Novak - 147-164 Improved approaches to the exact solution of the machine covering problem
by Rico Walter & Martin Wirth & Alexander Lawrinenko - 165-182 A hybrid multi-objective immune algorithm for predictive and reactive scheduling
by Iwona Paprocka & Bożena Skołud - 183-197 Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations
by Liliana Grigoriu & Dirk Briskorn - 199-209 Batched bin packing revisited
by Gyorgy Dosa - 211-218 Unary NP-hardness of minimizing the number of tardy jobs with deadlines
by Jinjiang Yuan
February 2017, Volume 20, Issue 1
- 1-1 Journal of Scheduling (2017)
by Edmund Burke & Michael Pinedo - 3-24 Increasing airport capacity utilisation through optimum slot scheduling: review of current developments and identification of future needs
by Konstantinos G. Zografos & Michael A. Madas & Konstantinos N. Androutsopoulos - 25-42 Scheduling shipments in closed-loop sortation conveyors
by Dirk Briskorn & Simon Emde & Nils Boysen - 43-55 Optimizing railway crew schedules with fairness preferences
by Silke Jütte & Daniel Müller & Ulrich W. Thonemann - 57-65 An integrated model for the transshipment yard scheduling problem
by Mateusz Cichenski & Florian Jaehn & Grzegorz Pawlak & Erwin Pesch & Gaurav Singh & Jacek Blazewicz - 67-83 Real-time management of berth allocation with stochastic arrival and handling times
by Nitish Umang & Michel Bierlaire & Alan L. Erera - 85-101 Scheduling reclaimers serving a stock pad at a coal terminal
by Thomas Kalinowski & Reena Kapoor & Martin W. P. Savelsbergh - 103-113 Optimization-based resource allocation for software as a service application in cloud computing
by Chunlin Li & Yun Chang Liu & Xin Yan
December 2016, Volume 19, Issue 6
- 617-618 New challenges in scheduling theory
by Jacek Blazewicz & Benjamin Moseley & Erwin Pesch & Denis Trystram & Guochuan Zhang - 619-625 Throughput maximization for speed scaling with agreeable deadlines
by Eric Angel & Evripidis Bampis & Vincent Chau & Dimitrios Letsios - 627-640 Co-scheduling algorithms for high-throughput workload execution
by Guillaume Aupy & Manu Shantharam & Anne Benoit & Yves Robert & Padma Raghavan - 641-658 Optimizing memory allocation for multistage scheduling including setup times
by Anne Benoit & Mathias Coqblin & Jean-Marc Nicod & Veronika Rehn-Sonigo - 659-685 Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines
by Peter Brucker & Natalia V. Shakhlevich - 687-699 Scheduling for electricity cost in a smart grid
by Mihai Burcea & Wing-Kai Hon & Hsiang-Hsuan Liu & Prudence W. H. Wong & David K. Y. Yau - 701-728 Normal-form preemption sequences for an open problem in scheduling theory
by Bo Chen & Ed Coffman & Dariusz Dereniowski & Wiesław Kubiak - 729-736 Scheduling on parallel identical machines with late work criterion: Offline and online cases
by Xin Chen & Malgorzata Sterna & Xin Han & Jacek Blazewicz - 737-757 Scheduling with time-dependent discrepancy times
by Florian Jaehn & Helmut A. Sedding - 759-767 On scheduling with non-increasing time slot cost to minimize total weighted completion time
by Yingchao Zhao & Xiangtong Qi & Minming Li
October 2016, Volume 19, Issue 5
- 493-525 Scheduling operating rooms: achievements, challenges and pitfalls
by Michael Samudra & Carla Van Riet & Erik Demeulemeester & Brecht Cardoen & Nancy Vansteenkiste & Frank E. Rademakers - 527-546 Finding optimal tour schedules on transportation paths under extended time window constraints
by Stefan Bock - 547-561 Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime
by Peruvemba Sundaram Ravi & Levent Tunçel & Michael Huang - 563-582 A reclaimer scheduling problem arising in coal stockyard management
by Enrico Angelelli & Thomas Kalinowski & Reena Kapoor & Martin W. P. Savelsbergh - 583-600 Scheduling parallel-machine batch operations to maximize on-time delivery performance
by Shubin Xu & James C. Bean - 601-607 An analysis of the non-preemptive mixed-criticality match-up scheduling problem
by Zdeněk Hanzálek & Tomáš Tunys & Přemysl Šůcha - 609-616 High-multiplicity scheduling on one machine with forbidden start and completion times
by Michaël Gabay & Christophe Rapine & Nadia Brauner
August 2016, Volume 19, Issue 4
- 367-376 A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing
by Abdoul Bitar & Stéphane Dauzère-Pérès & Claude Yugma & Renaud Roussel - 377-389 Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays
by Sara Ceschia & Andrea Schaerf - 391-400 Temporal linear relaxation in IBM ILOG CP Optimizer
by Philippe Laborie & Jérôme Rogerie - 401-408 Lawler’s minmax cost algorithm: optimality conditions and uncertainty
by Nadia Brauner & Gerd Finke & Yakov Shafransky & Dzmitry Sledneu - 409-428 A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations
by Patricio Lamas & Erik Demeulemeester - 429-452 Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem
by Yi Tan & Torsten Hildebrandt & Bernd Scholz-Reiter - 453-465 Late acceptance hill-climbing for high school timetabling
by George H. G. Fonseca & Haroldo G. Santos & Eduardo G. Carrano - 467-478 Scheduling evacuation operations
by Kaouthar Deghdak & Vincent T’kindt & Jean-Louis Bouquard - 479-492 A Step Counting Hill Climbing Algorithm applied to University Examination Timetabling
by Yuri Bykov & Sanja Petrovic
June 2016, Volume 19, Issue 3
- 213-213 Preface
by Graham Kendall & Greet Vanden Berghe & Barry McCollum - 215-225 Time-hierarchical scheduling
by Jens Leoff & Heiner Ackermann & Karl-Heinz Küfer - 227-243 Line search method for solving a non-preemptive strictly periodic scheduling problem
by Clément Pira & Christian Artigues - 245-255 Novel dual discounting functions for the Internet shopping optimization problem: new algorithms
by Jacek Blazewicz & Nathanael Cheriere & Pierre-Francois Dutot & Jedrzej Musial & Denis Trystram - 257-270 Real-life examination timetabling
by Tomáš Müller - 271-283 The Multi-Mode Resource-Constrained Multi-Project Scheduling Problem
by Tony Wauters & Joris Kinable & Pieter Smet & Wim Vancroonenburg & Greet Berghe & Jannes Verstichel - 285-293 A complexity analysis and an algorithmic approach to student sectioning in existing timetables
by M. Dostert & A. Politz & H. Schmitz - 295-307 An integer programming approach to the multimode resource-constrained multiproject scheduling problem
by Túlio A. M. Toffolo & Haroldo G. Santos & Marco A. M. Carvalho & Janniele A. Soares - 309-334 Exact algorithms for single-machine scheduling with time windows and precedence constraints
by Morteza Davari & Erik Demeulemeester & Roel Leus & Fabrice Talla Nobibon - 335-348 A decision support approach to automatic timetabling in higher education institutions
by Pedro Fernandes & Carla Sofia Pereira & Armando Barbosa - 349-366 Uplink scheduling for joint wireless orthogonal frequency and time division multiple access networks
by Pablo Adasme & Abdel Lisser
April 2016, Volume 19, Issue 2
- 107-133 An exact algorithm for an integrated project staffing problem with a homogeneous workforce
by Broos Maenhout & Mario Vanhoucke - 135-152 Measuring the impact of adversarial errors on packet scheduling strategies
by Antonio Fernández Anta & Chryssis Georgiou & Dariusz R. Kowalski & Joerg Widmer & Elli Zavou - 153-163 Relocation scheduling subject to fixed processing sequences
by Bertrand M. T. Lin & F. J. Hwang & Alexander V. Kononov - 165-176 Optimal K-unit cycle scheduling of two-cluster tools with residency constraints and general robot moving times
by Xin Li & Richard Y. K. Fung - 177-190 Single machine scheduling problems with uncertain parameters and the OWA criterion
by Adam Kasperski & Paweł Zieliński - 191-205 Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem
by Rym M’Hallah & Ali Alhajraf - 207-211 A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem
by Ivar Massabò & Giuseppe Paletta & Alex J. Ruiz-Torres
February 2016, Volume 19, Issue 1
- 1-1 Journal of Scheduling (2016)
by Edmund Burke & Michael Pinedo - 3-19 A survey of offline algorithms for energy minimization under deadline constraints
by Marco E. T. Gerards & Johann L. Hurink & Philip K. F. Hölzenspies - 21-31 A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines
by Kejun Zhao & Xiwen Lu & Manzhan Gu - 33-42 MP or not MP: that is the question
by Federico Della Croce - 43-60 A genetic algorithm for the robust resource leveling problem
by Hongbo Li & Erik Demeulemeester - 61-72 A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job
by Aldar Dugarzhapov & Alexander Kononov - 73-90 A graph coloring approach to the deployment scheduling and unit assignment problem
by Mark Zais & Manuel Laguna - 91-106 A mixed integer programming approach to multi-skilled workforce scheduling
by Rodolfo Cuevas & Juan-Carlos Ferrer & Mathias Klapp & Juan-Carlos Muñoz