Printed from https://ideas.repec.org/s/spr/jsched.html
Content
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 - 513-523 Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
by Tolga Bektaş & Alper Hamzadayı & Rubén Ruiz
June 2020, Volume 23, Issue 3
- 289-299 Single machine scheduling to maximize the number of on-time jobs with generalized due-dates
by Enrique Gerstl & Gur Mosheiov - 301-325 Resource-constrained multi-project scheduling: benchmark datasets and decoupled scheduling
by Rob Eynde & Mario Vanhoucke - 327-336 Two-machine flow shops with an optimal permutation schedule under a storage constraint
by Yunhong Min & Byung-Cheon Choi & Myoung-Ju Park - 337-361 Optimizing the physician scheduling problem in a large hospital ward
by Renata Mansini & Roberto Zanotti - 363-377 Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
by Timo Gschwind & Stefan Irnich & Christian Tilk & Simon Emde - 379-396 The optimal design of round-robin tournaments with three players
by Alex Krumer & Reut Megidish & Aner Sela - 397-410 Evaluating periodic rescheduling policies using a rolling horizon framework in an industrial-scale multipurpose plant
by Zachariah Stevenson & Ricardo Fukasawa & Luis Ricardez-Sandoval
April 2020, Volume 23, Issue 2
- 155-162 An optimal online algorithm for scheduling with general machine cost functions
by Islam Akaria & Leah Epstein - 163-176 The Longest Processing Time rule for identical parallel machines revisited
by Federico Della Croce & Rosario Scatamacchia - 177-209 The flexible break assignment problem for large tour scheduling problems with an application to airport ground handlers
by Ferdinand Kiermaier & Markus Frey & Jonathan F. Bard - 211-232 Broadcasting a file in a communication network
by Kai-Simon Goetzmann & Tobias Harks & Max Klimm - 233-251 A polyhedral study of event-based models for the resource-constrained project scheduling problem
by Alexander Tesch - 253-264 The extended roster quality staffing problem: addressing roster quality variation within a staffing planning period
by Komarudin & Tim De Feyter & Marie-Anne Guerry & Greet Vanden Berghe - 265-288 A diving heuristic for planning and scheduling surgical cases in the operating room department with nurse re-rostering
by Babak Akbarzadeh & Ghasem Moslehi & Mohammad Reisi-Nafchi & Broos Maenhout
February 2020, Volume 23, Issue 1
- 1-2 Journal of scheduling (2020)
by Edmund Burke & Michael Pinedo - 3-47 A review of four decades of time-dependent scheduling: main results, new topics, and open problems
by Stanisław Gawiejnowicz - 49-69 Metaheuristics for solving a multi-objective flow shop scheduling problem with sequence-dependent setup times
by V. Anjana & R. Sridharan & P. N. Ram Kumar - 71-93 A hybrid algorithm for the vehicle routing problem with three-dimensional loading constraints and mixed backhauls
by Henriette Koch & Maximilian Schlögell & Andreas Bortfeldt - 95-115 Minimizing the waiting time for a one-way shuttle service
by Laurent Daudet & Frédéric Meunier - 117-133 Approximation algorithms for the twin robot scheduling problem
by Florian Jaehn & Andreas Wiehl - 135-143 Maximizing the number of jobs scheduled at their baseline starting times in case of machine failures
by Philippe Chrétienne - 145-154 Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines
by S. S. Panwalkar & Christos Koulamas
December 2019, Volume 22, Issue 6
- 607-621 Sequencing assembly lines to facilitate synchronized just-in-time part supply
by Simon Emde & Lukas Polten - 623-634 Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
by Péter Györgyi & Tamás Kis - 635-661 Shop scheduling problems with pliable jobs
by S. Knust & N. V. Shakhlevich & S. Waldherr & C. Weiß - 663-676 On the parameterized tractability of the just-in-time flow-shop scheduling problem
by Danny Hermelin & Dvir Shabtay & Nimrod Talmon - 677-689 Single machine scheduling with stochastically dependent times
by Wei Wei - 691-707 Single-machine scheduling with job-dependent machine deterioration
by Wenchang Luo & Yao Xu & Weitian Tong & Guohui Lin - 709-714 A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time
by Tianyu Wang & Odile Bellenguez-Morineau
October 2019, Volume 22, Issue 5
- 499-515 A unified view of parallel machine scheduling with interdependent processing rates
by Bahram Alidaee & Haibo Wang & R. Bryan Kethley & Frank Landram - 517-541 A decomposition-based approach to the scheduling of identical automated yard cranes at container terminals
by Amelie Eilken - 543-565 Single-machine common due date total earliness/tardiness scheduling with machine unavailability
by Kerem Bülbül & Safia Kedad-Sidhoum & Halil Şen - 567-580 Risk-averse single machine scheduling: complexity and approximation
by Adam Kasperski & Paweł Zieliński - 581-593 The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
by Rubing Chen & Jinjiang Yuan & Yuan Gao - 595-601 Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines
by Rubing Chen & Jinjiang Yuan - 603-606 Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity
by Mikhail Y. Kovalyov & Dmitrij Šešok
August 2019, Volume 22, Issue 4
- 379-391 The evolution of schematic representations of flow shop scheduling problems
by S. S. Panwalkar & Christos Koulamas - 393-411 Malleable scheduling for flows of jobs and applications to MapReduce
by Viswanath Nagarajan & Joel Wolf & Andrey Balmin & Kirsten Hildrum - 413-431 Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs
by Hui-Chih Hung & Bertrand M. T. Lin & Marc E. Posner & Jun-Min Wei - 433-447 Parallel machine makespan minimization subject to machine availability and total completion time constraints
by Yumei Huo - 449-463 Unbounded parallel-batch scheduling with drop-line tasks
by Yuan Gao & Jinjiang Yuan & Zhigang Wei - 465-471 The single-processor scheduling problem with time restrictions: complexity and related problems
by Rachid Benmansour & Oliver Braun & Saïd Hanafi - 473-485 Quality of strong equilibria for selfish bin packing with uniform cost sharing
by György Dósa & Leah Epstein - 487-497 Lower bounds for online bin covering-type problems
by János Balogh & Leah Epstein & Asaf Levin
June 2019, Volume 22, Issue 3
- 263-269 The Complexity of Parallel Machine Scheduling of Unit-Processing-Time Jobs under Level-Order Precedence Constraints
by Tianyu Wang & Odile Bellenguez-Morineau - 271-288 Stochastic project management: multiple projects with multi-skilled human resources
by Thomas Felberbauer & Walter J. Gutjahr & Karl F. Doerner - 289-304 An approximation scheme for the bi-scenario sum of completion times trade-off problem
by Miri Gilenson & Hussein Naseraldin & Liron Yedidsion - 305-313 Parameterized complexity of a coupled-task scheduling problem
by S. Bessy & R. Giroudeau - 315-333 Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria
by Yunqiang Yin & Youhua Chen & Kaida Qin & Dujuan Wang - 335-357 Scheduling parallel batching machines in a sequence
by Ward Passchyn & Frits C. R. Spieksma - 359-377 Multistage interval scheduling games
by Arne Herzel & Michael Hopf & Clemens Thielen
April 2019, Volume 22, Issue 2
- 137-154 Scheduling recurring radiotherapy appointments in an ion beam facility
by Petra Vogl & Roland Braune & Karl F. Doerner - 155-172 Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem
by Niels-Christian Fink Bagger & Guy Desaulniers & Jacques Desrosiers - 173-182 A multi-mode resource-constrained project scheduling reformulation for the waterway ship scheduling problem
by Alessandro Hill & Eduardo Lalla-Ruiz & Stefan Voß & Marcos Goycoolea - 183-192 Online pulse interleaving task scheduling for multifunction radar
by Haowei Zhang & Junwei Xie & Qiyong Hu & Zhaojian Zhang & Binfeng Zong - 193-193 Correction to: Online pulse interleaving task scheduling for multifunction radar
by Haowei Zhang & Junwei Xie & Qiyong Hu & Zhaojian Zhang & Binfeng Zong - 195-209 ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors
by Sanjoy K. Baruah & Vincenzo Bonifaci & Renato Bruni & Alberto Marchetti-Spaccamela - 211-237 The proactive and reactive resource-constrained project scheduling problem
by Morteza Davari & Erik Demeulemeester - 239-253 Scheduling problems over a network of machines
by Zachary Friggstad & Arnoosh Golestanian & Kamyar Khodamoradi & Christopher Martin & Mirmahdi Rahgoshay & Mohsen Rezapour & Mohammad R. Salavatipour & Yifeng Zhang - 255-262 A note on minimizing total weighted completion time with an unexpected machine unavailable interval
by Peihai Liu & Chao Wang & Xiwen Lu
February 2019, Volume 22, Issue 1
- 1-2 Journal of scheduling (2019)
by Edmund Burke & Michael Pinedo - 3-20 Inductive $$k$$ k -independent graphs and c-colorable subgraphs in scheduling: a review
by Matthias Bentert & René Bevern & Rolf Niedermeier - 21-57 A unified heuristic and an annotated bibliography for a large class of earliness–tardiness scheduling problems
by Arthur Kramer & Anand Subramanian - 59-68 No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths
by J.-C. Billaut & F. Della Croce & F. Salassa & V. T’kindt - 69-83 The venue management problem: setting staffing levels, shifts and shift schedules at concession stands
by Oyku Ahipasaoglu & Nesim Erkip & Oya Ekin Karasan - 85-105 An efficient train scheduling algorithm on a single-track railway system
by Xiaoming Xu & Keping Li & Lixing Yang & Ziyou Gao - 107-118 Scheduling and rescheduling elective patients in operating rooms to minimise the percentage of tardy patients
by Francisco Ballestín & Ángeles Pérez & Sacramento Quintanilla - 119-135 A polynomial-time approximation scheme for the airplane refueling problem
by Iftah Gamzu & Danny Segev
December 2018, Volume 21, Issue 6
- 579-580 In memoriam: Dr. Joseph Leung
by Nicholas G. Hall & Yumei Huo & Benjamin Li & Michael Pinedo & Hairong Zhao - 581-582 New challenges in scheduling theory
by Jacek Blazewicz & Benjamin Moseley & Erwin Pesch & Denis Trystram & Guochuan Zhang - 583-593 Shared processor scheduling
by Dariusz Dereniowski & Wiesław Kubiak - 595-606 Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines
by Dominik Kress & Maksim Barketau & Erwin Pesch - 607-617 Combining two-stage stochastic programming and recoverable robustness to minimize the number of late jobs in the case of uncertain processing times
by Marjan Akker & Han Hoogeveen & Judith Stoef - 619-631 Scheduling fully parallel jobs
by Kai Wang & Vincent Chau & Minming Li - 633-646 Speed scaling problems with memory/cache consideration
by Weiwei Wu & Minming Li & Kai Wang & He Huang & Enhong Chen - 647-654 Online scheduling of moldable parallel tasks
by Deshi Ye & Danny Z. Chen & Guochuan Zhang
October 2018, Volume 21, Issue 5
- 483-492 An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines
by Manzhan Gu & Jinwei Gu & Xiwen Lu - 493-503 Scheduling meets n-fold integer programming
by Dušan Knop & Martin Koutecký - 505-516 Models and algorithms for energy-efficient scheduling with immediate start of jobs
by Akiyoshi Shioura & Natalia V. Shakhlevich & Vitaly A. Strusevich & Bernhard Primas - 517-531 A two-stage stochastic program for multi-shift, multi-analyst, workforce optimization with multiple on-call options
by Douglas S. Altner & Anthony C. Rojas & Leslie D. Servi - 533-543 Admission control in shared memory switches
by Patrick Eugster & Alex Kesselman & Kirill Kogan & Sergey Nikolenko & Alexander Sirotkin - 545-563 A new algorithm based on evolutionary computation for hierarchically coupled constraint optimization: methodology and application to assembly job-shop scheduling
by Pan Zou & Manik Rajora & Steven Y. Liang - 565-578 Rescheduling due to machine disruption to minimize the total weighted completion time
by Wenchang Luo & Taibo Luo & Randy Goebel & Guohui Lin
August 2018, Volume 21, Issue 4
- 387-411 Two-stage hybrid flowshop scheduling with simultaneous processing machines
by Bailin Wang & Kai Huang & Tieke Li - 413-428 Discovering dispatching rules from data using imitation learning: A case study for the job-shop problem
by Helga Ingimundardottir & Thomas Philip Runarsson - 429-441 Online-bounded analysis
by Joan Boyar & Leah Epstein & Lene M. Favrholdt & Kim S. Larsen & Asaf Levin - 443-460 Integrated production and outbound distribution scheduling problems with job release dates and deadlines
by Liang-Liang Fu & Mohamed Ali Aloulou & Christian Artigues - 461-482 Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
by Zhijun Xu & Dehua Xu
June 2018, Volume 21, Issue 3
- 269-284 A survey on makespan minimization in semi-online environments
by Leah Epstein - 285-304 An implicit model for multi-activity shift scheduling problems
by Sana Dahmen & Monia Rekik & François Soumis - 305-312 The triangle scheduling problem
by Christoph Dürr & Zdeněk Hanzálek & Christian Konrad & Yasmina Seddik & René Sitters & Óscar C. Vásquez & Gerhard Woeginger - 313-325 Improved algorithms for resource allocation under varying capacity
by Venkatesan T. Chakaravarthy & Anamitra R. Choudhury & Shalmoli Gupta & Sambudha Roy & Yogish Sabharwal - 327-336 Flexible bandwidth assignment with application to optical networks
by Hadas Shachnai & Ariella Voloshin & Shmuel Zaks - 337-348 Single machine scheduling with job delivery to multiple customers
by Jianming Dong & Xueshi Wang & Jueliang Hu & Guohui Lin - 349-365 New strategies for stochastic resource-constrained project scheduling
by Salim Rostami & Stefan Creemers & Roel Leus - 367-386 Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem
by Lunce Fu & Maged Dessouky
April 2018, Volume 21, Issue 2
- 129-130 Preface
by Zdenek Hanzalek & Graham Kendall & Barry McCollum & Premysl Sucha & Greet Vanden Berghe - 131-142 A list-scheduling heuristic for the short-term planning of assessment centers
by Adrian Zimmermann & Norbert Trautmann - 143-165 The impact of overtime as a time-based proactive scheduling and reactive allocation strategy on the robustness of a personnel shift roster
by Jonas Ingels & Broos Maenhout - 167-189 Staff assignment with lexicographically ordered acceptance levels
by Tom Rihm & Philipp Baumann - 191-207 Approaches to modeling train scheduling problems as job-shop problems with blocking constraints
by Julia Lange & Frank Werner - 209-226 A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines
by Yi Tan & Lars Mönch & John W. Fowler - 227-233 Exact exponential algorithms for 3-machine flowshop scheduling problems
by Lei Shang & Christophe Lenté & Mathieu Liedloff & Vincent T’Kindt - 235-249 Family scheduling with batch availability in flow shops to minimize makespan
by Liji Shen & Jatinder N. D. Gupta - 251-267 Multi-stage resource-aware scheduling for data centers with heterogeneous servers
by Tony T. Tran & Meghana Padmanabhan & Peter Yun Zhang & Heyse Li & Douglas G. Down & J. Christopher Beck
February 2018, Volume 21, Issue 1
- 1-1 Journal of Scheduling (2018)
by Edmund Burke & Michael Pinedo - 3-16 A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
by D. Prot & O. Bellenguez-Morineau - 17-33 Case mix classification and a benchmark set for surgery scheduling
by Gréanne Leeftink & Erwin W. Hans - 35-51 Energy-efficient scheduling and routing via randomized rounding
by Evripidis Bampis & Alexander Kononov & Dimitrios Letsios & Giorgio Lucarelli & Maxim Sviridenko - 53-76 Solving a wind turbine maintenance scheduling problem
by Aurélien Froger & Michel Gendreau & Jorge E. Mendoza & Eric Pinson & Louis-Martin Rousseau - 77-92 Scheduling shared continuous resources on many-cores
by Ernst Althaus & André Brinkmann & Peter Kling & Friedhelm Meyer Heide & Lars Nagel & Sören Riechers & Jiří Sgall & Tim Süß - 93-109 Task assignment with start time-dependent processing times for personnel at check-in counters
by Emilio Zamorano & Annika Becker & Raik Stolletz - 111-126 Scheduling electric vehicles and locating charging stations on a path
by Nils Boysen & Dirk Briskorn & Simon Emde - 127-128 The Current state of bounds on benchmark instances of the job-shop scheduling problem
by Jelke J. Hoorn
December 2017, Volume 20, Issue 6
- 543-543 Special issue: Twelfth Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2015)
by Yves Crama & Dries Goossens & Roel Leus & Michaël Schyns & Frits Spieksma - 545-555 Minimizing worst-case and average-case makespan over scenarios
by Esteban Feuerstein & Alberto Marchetti-Spaccamela & Frans Schalekamp & René Sitters & Suzanne Ster & Leen Stougie & Anke Zuylen - 557-581 Open Shop Scheduling with Synchronization
by C. Weiß & S. Waldherr & S. Knust & N. V. Shakhlevich - 583-592 Single machine scheduling with a generalized job-dependent cumulative effect
by Kabir Rustogi & Vitaly A. Strusevich - 593-600 Approximation for scheduling on uniform nonsimultaneous parallel machines
by Liliana Grigoriu & Donald K. Friesen