Printed from https://ideas.repec.org/s/spr/jsched.html
Content
June 2025, Volume 28, Issue 3
- 269-287 Recoverable robust single machine scheduling with polyhedral uncertainty
by Matthew Bold & Marc Goerigk - 289-310 A solution framework for multi-skilled project scheduling problems with hierarchical skills
by Jakob Snauwaert & Mario Vanhoucke - 311-328 A graphical evaluation and review technique for scheduling construction projects
by K. Pregina & M. Ramesh Kannan - 329-353 Task assignments with rotations and flexible shift starts to improve demand coverage and staff satisfaction in healthcare
by Jan Schoenfelder & Jakob Heins & Jens O. Brunner - 355-375 Hybrid-sched: a QoS adaptive offline–online scheduler for real-time tasks on multi-cores
by Piyoosh Purushothaman Nair & Hareesh Reddi & Rajesh Devaraj & Arnab Sarkar
April 2025, Volume 28, Issue 2
- 157-158 Preface: the practice and theory of automated timetabling (2022)
by Ender Özcan & Patrick De Causmaecker & Greet Vanden Berghe & Dries Goossens - 159-181 On the computation of robust examination timetables: methods and experimental results
by Bernd Bassimir & Rolf Wanka - 183-194 A proven optimal result for a benchmark instance of the uncapacitated examination timetabling problem
by Angelos Dimitsas & Christos Gogos & Christos Valouxis & Vasileios Nastos & Panayiotis Alefragis - 195-215 Modelling and solving the university course timetabling problem with hybrid teaching considerations
by Matthew Davison & Ahmed Kheiri & Konstantinos G. Zografos - 217-232 Multi-neighbourhood simulated annealing for the ITC-2007 capacitated examination timetabling problem
by David Van Bulck & Dries Goossens & Andrea Schaerf - 233-246 Solving the medical student scheduling problem using simulated annealing
by Eugenia Zanazzo & Sara Ceschia & Agostino Dovier & Andrea Schaerf - 247-267 Real-world university course timetabling at the International Timetabling Competition 2019
by Tomáš Müller & Hana Rudová & Zuzana Müllerová
February 2025, Volume 28, Issue 1
- 1-63 Scientific workflow scheduling algorithms in cloud environments: a comprehensive taxonomy, survey, and future directions
by Ehsan Saeedizade & Mehrdad Ashtiani - 65-84 A hybrid local search algorithm for the continuous energy-constrained scheduling problem
by Roel Brouwer & Marjan Akker & Han Hoogeveen - 85-99 Selection hyper-heuristics and job shop scheduling problems: How does instance size influence performance?
by Fernando Garza-Santisteban & Jorge Mario Cruz-Duarte & Ivan Amaya & José Carlos Ortiz-Bayliss & Santiago Enrique Conant-Pablos & Hugo Terashima-Marín - 101-120 Scheduling of e-commerce packaging machines: blocking machines and their impact on the performance–waste tradeoff
by Dirk Briskorn & Nils Boysen & Lennart Zey - 121-138 On variants of a load-balancing problem with unit-load jobs
by Péter Györgyi & Tamás Kis & Evelin Szögi - 139-156 Complexity of scheduling few types of jobs on related and unrelated machines
by Martin Koutecký & Johannes Zink
December 2024, Volume 27, Issue 6
- 525-543 Minimizing the earliness–tardiness for the customer order scheduling problem in a dedicated machine environment
by Julius Hoffmann & Janis S. Neufeld & Udo Buscher - 545-556 Serial batching to minimize the weighted number of tardy jobs
by Danny Hermelin & Matthias Mnich & Simon Omlor - 557-564 Network routing on regular digraphs and their line graphs
by Vance Faber & Noah Streib - 565-585 Scheduling a single machine with multiple due dates per job
by Raphael Kühn & Christian Weiß & Heiner Ackermann & Sandy Heydrich - 587-606 Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems
by Pascale Bendotti & Luca Brunod Indrigo & Philippe Chrétienne & Bruno Escoffier - 607-622 Investigating constraint programming and hybrid methods for real world industrial test laboratory scheduling
by Tobias Geibinger & Florian Mischek & Nysret Musliu
October 2024, Volume 27, Issue 5
- 409-422 Quick and situ-aware spatiotemporal scheduling for shipbuilding manufacturing
by Junying He & Soon-Ik Hong & Seong-Hee Kim - 423-439 Short-term underground mine planning with uncertain activity durations using constraint programming
by Younes Aalian & Michel Gamache & Gilles Pesant - 441-459 Production scheduling decision-making technology for multiple CNC machining centers with constraints on serviceable time
by Jianzhong Qiu & Jun Wu & Xi Chen & Bingyan Zhao & Yan Fang - 461-484 Scheduling periodic messages on a shared link without buffering
by Maël Guiraud & Yann Strozecki - 485-505 Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization
by Tifenn Rault & Faiza Sadi & Jean-Charles Billaut & Ameur Soukhal - 507-524 Scheduling of Earth observing satellites using distributed constraint optimization
by Shai Krigman & Tal Grinshpoun & Lihi Dery
August 2024, Volume 27, Issue 4
- 319-328 Approximating weighted completion time via stronger negative correlation
by Alok Baveja & Xiaoran Qu & Aravind Srinivasan - 329-340 An exact solution with an improved running time for the routing flow shop problem with two machines
by Ilya Chernykh & Alexander Kononov & Sergey Sevastyanov - 341-361 Block-based state-expanded network models for multi-activity shift scheduling
by Michael Römer - 363-373 Sequential solutions in machine scheduling games
by Cong Chen & Paul Giessler & Akaki Mamageishvili & Matúš Mihalák & Paolo Penna - 375-392 Continuity of care in home health care scheduling: a rolling horizon approach
by Şeyma Güven-Koçak & Aliza Heching & Pınar Keskinocak & Alejandro Toriello - 393-407 A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses
by Michele Barbato & Alberto Ceselli & Giovanni Righini
June 2024, Volume 27, Issue 3
- 225-226 Dynamic scheduling problems in theory and practice
by Stanisław Gawiejnowicz & Bertrand Miao-Tsong Lin & Gur Mosheiov - 227-237 Single machine scheduling with step-learning
by Matan Atsmony & Baruch Mor & Gur Mosheiov - 239-256 Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times
by Dvir Shabtay & Baruch Mor - 257-275 Mixed-model moving assembly line material placement optimization for a shorter time-dependent worker walking time
by Helmut A. Sedding - 277-297 Scheduling with periodic availability constraints to minimize makespan
by Lishi Yu & Zhiyi Tan - 299-308 Improving scheduling in multi-AGV systems by task prediction
by Hongkai Fan & Dong Li & Bo Ouyang & Zhi Yan & Yaonan Wang - 309-318 Single-machine primary–secondary scheduling with total tardiness being the primary criterion
by Qiulan Zhao & Jinjiang Yuan
April 2024, Volume 27, Issue 2
- 119-133 Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines
by Claire Hanen & Alix Munier Kordon - 135-149 A novel and efficient real-time sequencing strategy for appointment scheduling with unpunctual patients
by Chao Li & Zhi Yang & Fajun Yang & Feng Wang - 151-164 Scheduling with non-renewable resources: minimizing the sum of completion times
by Kristóf Bérczi & Tamás Király & Simon Omlor - 165-182 A parallel ruin and recreate heuristic for personnel scheduling in a flexible working environment
by Rachid Hassani & Guy Desaulniers & Issmail Elhallaoui - 183-202 A scheduling framework for distributed key-value stores and its application to tail latency minimization
by Sonia Ben Mokhtar & Louis-Claude Canon & Anthony Dugois & Loris Marchal & Etienne Rivière - 203-224 Preemptive scheduling of parallel jobs of two sizes with controllable processing times
by Akiyoshi Shioura & Vitaly A. Strusevich & Natalia V. Shakhlevich
February 2024, Volume 27, Issue 1
- 1-27 Dynamic personnel rescheduling: insights and recovery strategies
by Broos Maenhout & Mario Vanhoucke - 29-49 A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing
by Frederik Ferid Ostermeier & Jochen Deuse - 51-60 The price of anarchy for a berth allocation game
by Jiayin Pan & Cong Chen & Yinfeng Xu - 61-86 Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits
by Xiaojuan Jiang & Kangbok Lee & Michael L. Pinedo - 87-101 Scheduling the repair and replacement of individual components in operating systems: a bi-objective mathematical optimization model
by Gabrijela Obradović & Ann-Brith Strömberg & Kristian Lundberg - 103-118 The preemptive resource allocation problem
by Kanthi Sarpatwar & Baruch Schieber & Hadas Shachnai
December 2023, Volume 26, Issue 6
- 519-521 Mathematical challenges in scheduling theory
by Jacek Blazewicz & Benjamin Moseley & Erwin Pesch & Denis Trystram & Guochuan Zhang - 523-533 Approximation algorithms for batch scheduling with processing set restrictions
by Xing Chai & Wenhua Li & C. T. Ng & T. C. E. Cheng - 535-542 Competitive algorithms for demand response management in a smart grid
by Vincent Chau & Shengzhong Feng & Nguyễn Kim Thắng - 543-558 A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints
by Kameng Nip & Zhenbo Wang - 559-570 An improved approximation algorithm for a scheduling problem with transporter coordination
by Yinling Wang & Xin Han & Yong Zhang & Jacek Blazewicz - 571-580 Scheduling on a graph with release times
by Wei Yu & Mordecai Golin & Guochuan Zhang
October 2023, Volume 26, Issue 5
- 411-411 Special Issue on papers from the 2019 Workshop on Models and Algorithms for Planning and Scheduling Problems
by Samir Khuller - 413-423 The flexibility of home away pattern sets
by Roel Lambers & Dries Goossens & Frits C. R. Spieksma - 425-442 Malleable scheduling beyond identical machines
by Dimitris Fotakis & Jannik Matuschke & Orestis Papadigenopoulos - 443-455 Well-behaved online load balancing against strategic jobs
by Bo Li & Minming Li & Xiaowei Wu - 457-477 Local search approaches for the test laboratory scheduling problem with variable task grouping
by Florian Mischek & Nysret Musliu & Andrea Schaerf - 479-495 Graph representation of the fixed route dial-a-ride problem
by Tal Grinshpoun & Elad Shufan & Hagai Ilani & Vadim Levit & Haya Brama - 497-517 Simulated annealing with penalization for university course timetabling
by Kadri Sylejmani & Edon Gashi & Adrian Ymeri
August 2023, Volume 26, Issue 4
- 335-351 Lot streaming for a two-stage assembly system in the presence of handling costs
by Niloy J. Mukherjee & Subhash C. Sarin & Daniel A. Neira - 353-367 Exact and metaheuristic methods for a real-world examination timetabling problem
by Mats Carlsson & Sara Ceschia & Luca Gaspero & Rasmus Ørnstrup Mikkelsen & Andrea Schaerf & Thomas Jacob Riis Stidsen - 369-382 A multivariate complexity analysis of the material consumption scheduling problem
by Matthias Bentert & Robert Bredereck & Péter Györgyi & Andrzej Kaczmarczyk & Rolf Niedermeier - 383-398 Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms
by Fangfang Wu & Zhongyi Jiang & Run Zhang & Xiandong Zhang - 399-402 A note on the shifting bottleneck procedure for job shop scheduling
by Murat Güngör - 403-409 A note: maximizing the weighted number of Just-in-Time jobs for a given job sequence
by Enrique Gerstl & Gur Mosheiov
June 2023, Volume 26, Issue 3
- 227-249 Competitive two-agent scheduling with release dates and preemption on a single machine
by Shi-Sheng Li & Ren-Xia Chen - 251-266 Optimization of scheduling problems with deterioration effects and an optional maintenance activity
by Xinyu Sun & Tao Liu & Xin-Na Geng & Yang Hu & Jing-Xiao Xu - 267-287 Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs
by Ulrich Pferschy & Julia Resch & Giovanni Righini - 289-314 Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling
by Yannik Zeiträg & José Rui Figueira - 315-329 A note on a single-shift days-off scheduling problem with sequence-dependent labor costs
by Eiji Mizutani & Kevin Alexander Sánchez Galeano - 331-334 On the complexity of open shop scheduling with time lags
by Wiesław Kubiak
April 2023, Volume 26, Issue 2
- 113-136 Scheduling a pick and place packaging line
by Tommaso Schettini & Federico Malucelli & Helena Ramalhinho - 137-145 Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using Inclusion–Exclusion
by Olivier Ploton & Vincent T’kindt - 147-167 Minimizing the expected waiting time of emergency jobs
by Arne Schulz & Malte Fliedner - 169-191 A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty
by François Clautiaux & Boris Detienne & Henri Lefebvre - 193-207 Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection
by Matan Atsmony & Gur Mosheiov - 209-225 Equitable scheduling on a single machine
by Klaus Heeger & Danny Hermelin & George B. Mertzios & Hendrik Molter & Rolf Niedermeier & Dvir Shabtay
February 2023, Volume 26, Issue 1
- 1-2 Editorial: Journal of Scheduling (2023)
by Edmund Burke - 3-18 A quest for a fair schedule: The International Young Physicists’ Tournament
by Katarína Cechlárová & Ágnes Cseh & Zsuzsanna Jankó & Marián Kireš & Lukáš Miňo - 19-41 How to charge while driving: scheduling point-to-point deliveries of an electric vehicle under overhead wiring
by Nils Boysen & Dirk Briskorn & Stefan Schwerdfeger - 43-59 Collaborative optimization of workshop layout and scheduling
by Yaliang Wang & Xinyu Fan & Chendi Ni & Kanghong Gao & Shousong Jin - 61-76 Parallel solutions for preemptive makespan scheduling on two identical machines
by Leah Epstein - 77-94 Joint replenishment meets scheduling
by Péter Györgyi & Tamás Kis & Tímea Tamási & József Békési - 95-111 A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints
by Kai Watermeyer & Jürgen Zimmermann
December 2022, Volume 25, Issue 6
- 623-623 In memoriam Moshe Dror
by Jacek Blazewicz - 625-641 Robust finite-horizon scheduling/rescheduling of operating rooms with elective and emergency surgeries under resource constraints
by F. Davarian & J. Behnamian - 643-657 Online algorithms to schedule a proportionate flexible flow shop of batching machines
by Christoph Hertrich & Christian Weiß & Heiner Ackermann & Sandy Heydrich & Sven O. Krumke - 659-674 Preemptive and non-preemptive scheduling on two unrelated parallel machines
by Alan J. Soper & Vitaly A. Strusevich - 675-704 Packing-based branch-and-bound for discrete malleable task scheduling
by Roland Braune - 705-719 Integrated break and carryover effect minimization
by Burak Çavdaroğlu & Tankut Atan - 721-740 Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs
by Myungho Lee & Kangbok Lee & Michael Pinedo
October 2022, Volume 25, Issue 5
- 503-505 In memoriam Gerhard Woeginger
by Jan Karel Lenstra & Franz Rendl & Frits Spieksma & Marc Uetz - 507-534 Exact and metaheuristic approaches for unrelated parallel machine scheduling
by Maximilian Moser & Nysret Musliu & Andrea Schaerf & Felix Winter - 535-545 Maximizing barrier coverage lifetime with static sensors
by Menachem Poss & Dror Rawitz - 547-565 A reinforcement learning algorithm for rescheduling preempted tasks in fog nodes
by Biji Nair & S. Mary Saira Bhanu - 567-576 Optimal energy scheduling of micro-grids considering the uncertainty of solar and wind renewable resources
by Mohammad Ali Taghikhani & Behnam Zangeneh - 577-587 On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates
by Gur Mosheiov & Daniel Oron & Dvir Shabtay - 589-621 An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
by Omid Shahvari & Rasaratnam Logendran & Madjid Tavana
August 2022, Volume 25, Issue 4
- 371-390 Introducing UniCorT: an iterative university course timetabling tool with MaxSAT
by Alexandre Lemos & Pedro T. Monteiro & Inês Lynce - 391-404 A mixed-integer programming approach for solving university course timetabling problems
by Efstratios Rappos & Eric Thiémard & Stephan Robert & Jean-François Hêche - 405-428 A graph-based MIP formulation of the International Timetabling Competition 2019
by Dennis S. Holm & Rasmus Ø. Mikkelsen & Matias Sørensen & Thomas J. R. Stidsen - 429-452 A parallelized matheuristic for the International Timetabling Competition 2019
by Rasmus Ø. Mikkelsen & Dennis S. Holm - 453-475 A large neighborhood search approach for the paint shop scheduling problem
by Felix Winter & Nysret Musliu - 477-501 Bi-criteria simulated annealing for the curriculum-based course timetabling problem with robustness approximation
by Can Akkan & Ayla Gülcü & Zeki Kuş
June 2022, Volume 25, Issue 3
- 259-259 Advances in the practice and theory of automated timetabling
by Ender Özcan & Patrick Causmaecker & Greet Vanden Berghe - 261-271 Optimizing rest times and differences in games played: an iterative two-phase approach
by David Van Bulck & Dries Goossens - 273-286 A fix-and-optimize heuristic for the ITC2021 sports timetabling problem
by George H. G. Fonseca & Túlio A. M. Toffolo - 287-299 Pseudo-Boolean optimisation for RobinX sports timetabling
by Martin Mariusz Lester - 301-319 Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021
by Roberto Maria Rosati & Matteo Petris & Luca Di Gaspero & Andrea Schaerf - 321-338 Plant shutdown maintenance workforce team assignment and job scheduling
by Hesham K. Alfares - 339-370 Exact and meta-heuristic approaches for the production leveling problem
by Johannes Vass & Marie-Louise Lackner & Christoph Mrkvicka & Nysret Musliu & Felix Winter
April 2022, Volume 25, Issue 2
- 139-155 Further connections between contract-scheduling and ray-searching problems
by Spyros Angelopoulos - 157-176 An analysis of the parameterized complexity of periodic timetabling
by Niels Lindner & Julian Reisch - 177-190 Project scheduling in a lean environment to maximize value and minimize overruns
by Claudio Szwarcfiter & Yale T. Herer & Avraham Shtub - 191-202 Single-machine scheduling with resource-dependent processing times and multiple unavailability periods
by Byung-Cheon Choi & Myoung-Ju Park - 203-228 Aircraft landing planning under uncertain conditions
by Marie-Sklaerder Vié & Nicolas Zufferey & Roel Leus - 229-255 A general scheme for solving a large set of scheduling problems with rejection in FPT time
by Danny Hermelin & Dvir Shabtay & Chen Zelig & Michael Pinedo - 257-257 Correction to: Broadcasting a file in a communication network
by Kai-Simon Goetzmann & Tobias Harks & Max Klimm
February 2022, Volume 25, Issue 1
- 1-1 Editorial: Journal of Scheduling (2022)
by Edmund Burke - 3-34 Twin-crane scheduling during seaside workload peaks with a dedicated handshake area
by Lennart Zey & Dirk Briskorn & Nils Boysen - 35-58 Algorithm selection and instance space analysis for curriculum-based course timetabling
by Arnaud Coster & Nysret Musliu & Andrea Schaerf & Johannes Schoisswohl & Kate Smith-Miles - 59-88 A flexible mixed integer programming-based system for real-world nurse rostering
by Elín Björk Böðvarsdóttir & Niels-Christian Fink Bagger & Laura Elise Høffner & Thomas J. R. Stidsen - 89-105 Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times
by Hanane Krim & Nicolas Zufferey & Jean-Yves Potvin & Rachid Benmansour & David Duvivier - 107-124 Scheduling computations with provably low synchronization overheads
by Guilherme Rito & Hervé Paulino - 125-137 Minimizing the makespan on a single machine subject to modular setups
by Dirk Briskorn & Konrad Stephan & Nils Boysen
December 2021, Volume 24, Issue 6
- 553-567 Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates
by Baruch Mor & Gur Mosheiov & Dvir Shabtay - 569-588 Column generation for minimizing total completion time in a parallel-batching environment
by A. Alfieri & A. Druetto & A. Grosso & F. Salassa - 589-614 More on ordered open end bin packing
by János Balogh & Leah Epstein & Asaf Levin - 615-647 Theoretical and practical issues in single-machine scheduling with two job release and delivery times
by Alejandro Reynoso & Nodari Vakhania - 649-662 Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time
by Tianyu Wang & Odile Bellenguez - 663-680 Optimally rescheduling jobs with a Last-In-First-Out buffer
by Gaia Nicosia & Andrea Pacifici & Ulrich Pferschy & Julia Resch & Giovanni Righini
October 2021, Volume 24, Issue 5
- 455-457 New Perspectives in Scheduling Theory
by Jacek Blazewicz & Benjamin Moseley & Erwin Pesch & Denis Trystram & Guochuan Zhang - 459-467 Calibrations scheduling with arbitrary lengths and activation length
by Eric Angel & Evripidis Bampis & Vincent Chau & Vassilis Zissimopoulos - 469-481 Scheduling periodic I/O access with bi-colored chains: models and algorithms
by Emmanuel Jeannot & Guillaume Pallez & Nicolas Vidal - 483-487 Mirror scheduling problems with early work and late work criteria
by Xin Chen & Sergey Kovalev & Małgorzata Sterna & Jacek Błażewicz - 489-505 An approach to reduce energy consumption and performance losses on heterogeneous servers using power capping
by Tomasz Ciesielczyk & Alberto Cabrera & Ariel Oleksiak & Wojciech Piątek & Grzegorz Waligóra & Francisco Almeida & Vicente Blanco - 507-521 Scheduling divisible loads with time and cost constraints
by M. Drozdowski & N. V. Shakhlevich - 523-541 Stand-alone renewable power system scheduling for a green data center using integer linear programming
by Maroua Haddad & Jean-Marc Nicod & Marie-Cécile Péra & Christophe Varnier - 543-552 A new LP rounding algorithm for the active time problem
by Gruia Cǎlinescu & Kai Wang
August 2021, Volume 24, Issue 4
- 367-380 Routing two stacking cranes with predetermined container sequences
by Dirk Briskorn - 381-403 Scheduling with gaps: new models and algorithms
by Marek Chrobak & Mordecai Golin & Tak-Wah Lam & Dorian Nogneng - 405-412 A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing
by Antonina P. Khramova & Ilya Chernykh - 413-429 A memetic algorithm to address the multi-node resource-constrained project scheduling problem
by Luis F. Machado-Domínguez & Carlos D. Paternina-Arboleda & Jorge I. Vélez & Agustin Barrios-Sarmiento - 431-446 Online scheduling to minimize total weighted (modified) earliness and tardiness cost
by Arman Jabbari & Philip M. Kaminsky - 447-454 A note on the complexity of two supply chain scheduling problems
by Yuan Zhang & Jinjiang Yuan
June 2021, Volume 24, Issue 3
- 259-267 A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource
by Susumu Hashimoto & Shinji Mizuno - 269-290 Solving the nuclear dismantling project scheduling problem by combining mixed-integer and constraint programming techniques and metaheuristics
by Felix Hübner & Patrick Gerhards & Christian Stürck & Rebekka Volk - 291-318 Scheduling for multi-robot routing with blocking and enabling constraints
by Jayanth Krishna Mogali & Joris Kinable & Stephen F. Smith & Zachary B. Rubinstein - 319-328 Makespan minimization with OR-precedence constraints
by Felix Happach - 329-346 A hybrid evolutionary approach to job-shop scheduling with generic time lags
by Madiha Harrabi & Olfa Belkahla Driss & Khaled Ghedira - 347-366 Quantifying and enforcing robustness in staff rostering
by Toni I. Wickert & Pieter Smet & Greet Vanden Berghe
April 2021, Volume 24, Issue 2
- 123-135 Cyclic lot-sizing problems with sequencing costs
by Alexander Grigoriev & Vincent J. Kreuzen & Tim Oosterwijk - 137-174 Stochastic programming approach for unidirectional quay crane scheduling problem with uncertainty
by Shoufeng Ma & Hongming Li & Ning Zhu & Chenyi Fu - 175-196 Multiple dispatching rules allocation in real time using data mining, genetic algorithms, and simulation
by Mohamed Habib Zahmani & Baghdad Atmani - 197-208 Three-machine open shop with a bottleneck machine revisited
by Inna G. Drobouchevitch - 209-221 Scheduling coupled tasks with exact delays for minimum total job completion time
by Bo Chen & Xiandong Zhang - 223-236 Coupled task scheduling with time-dependent processing times
by Mostafa Khatami & Amir Salehipour - 237-258 Approximate and robust bounded job start scheduling for Royal Mail delivery offices
by Dimitrios Letsios & Jeremy T. Bradley & Suraj G & Ruth Misener & Natasha Page
February 2021, Volume 24, Issue 1
- 1-2 Editorial: Journal of Scheduling (2020)
by Edmund Burke - 3-25 An integrated rolling horizon approach to increase operating theatre efficiency
by Belinda Spratt & Erhan Kozan - 27-34 New results for scheduling to minimize tardiness on one machine with rejection and related problems
by Christos Koulamas & George Steiner - 35-48 Disruptions in timetables: a case study at Universidade de Lisboa
by Alexandre Lemos & Pedro T. Monteiro & Inês Lynce - 49-68 A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime
by Xin Li & José A. Ventura & Kevin A. Bunn - 69-82 Optimal work-conserving scheduler synthesis for real-time sporadic tasks using supervisory control of timed discrete-event systems
by Rajesh Devaraj & Arnab Sarkar & Santosh Biswas - 83-102 Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs
by Michal Penn & Tal Raviv - 103-121 Measuring the complexity of university timetabling instances
by Felipe Rosa-Rivera & Jose I. Nunez-Varela & Cesar A. Puente-Montejano & Sandra E. Nava-Muñoz
December 2020, Volume 23, Issue 6
- 629-630 Editorial: Dynamic Scheduling Problems
by Alessandro Agnetis & Stanisław Gawiejnowicz & Bertrand Miao-Tsong Lin & Gur Mosheiov - 631-641 Flowshop scheduling with learning effect and job rejection
by Baruch Mor & Gur Mosheiov & Dana Shapira - 643-648 A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times
by Nir Halman - 649-664 Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing
by Shaojun Lu & Jun Pei & Xinbao Liu & Xiaofei Qian & Nenad Mladenovic & Panos M. Pardalos - 665-680 Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects
by Alan J. Soper & Vitaly A. Strusevich - 681-691 Scheduling in data gathering networks with background communications
by Joanna Berlińska - 693-709 Approximation algorithms for energy-efficient scheduling of parallel jobs
by Alexander Kononov & Yulia Kovalenko - 711-731 A periodic optimization approach to dynamic pickup and delivery problems with time windows
by Farzaneh Karami & Wim Vancroonenburg & Greet Vanden Berghe - 733-744 New results for an open time-dependent scheduling problem
by Stanisław Gawiejnowicz & Wiesław Kurc - 745-749 On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty
by Yakov Shafransky & Viktor Shinkarevich - 751-768 Scheduling jobs with a V-shaped time-dependent processing time
by Helmut A. Sedding
October 2020, Volume 23, Issue 5
- 525-538 Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection
by Jinwen Ou - 539-554 A decomposition heuristic for rotational workforce scheduling
by Tristan Becker - 555-574 Dynamic speed scaling minimizing expected energy consumption for real-time tasks
by Bruno Gaujal & Alain Girault & Stephan Plassart - 575-593 Scheduling a proportionate flow shop of batching machines
by Christoph Hertrich & Christian Weiß & Heiner Ackermann & Sandy Heydrich & Sven O. Krumke - 595-608 Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments
by Jianming Dong & Joshua Chang & Bing Su & Jueliang Hu & Guohui Lin - 609-617 Serial-batching scheduling with two agents to minimize makespan and maximum cost
by Cheng He & Chunqi Xu & Hao Lin - 619-628 Scheduling two projects with controllable processing times in a single-machine environment
by Byung-Cheon Choi & Myoung-Ju Park
August 2020, Volume 23, Issue 4
- 411-429 On the exact solution of a large class of parallel machine scheduling problems
by Teobaldo Bulhões & Ruslan Sadykov & Anand Subramanian & Eduardo Uchoa - 431-449 An Efficient Filtering Algorithm for the Unary Resource Constraint with Transition Times and Optional Activities
by Sascha Cauwelaert & Cyrille Dejemeppe & Pierre Schaus - 451-464 Interruptible algorithms for multiproblem solving
by Spyros Angelopoulos & Alejandro López-Ortiz - 465-485 Interference aware scheduling of triple-crossover-cranes
by Dirk Briskorn & Lennart Zey - 487-496 Mixed batch scheduling on identical machines
by Jun-Qiang Wang & Guo-Qiang Fan & Zhixin Liu - 497-512 Single-machine scheduling with multi-agents to minimize total weighted late work
by Shi-Sheng Li & Jin-Jiang Yuan