Printed from https://ideas.repec.org/s/spr/jsched2.html
Content
February 2020, Volume 23, Issue 1
- 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 - 601-621 Online bin stretching with three bins
by Martin Böhm & Jiří Sgall & Rob Stee & Pavel Veselý - 623-634 Scheduling multipacket frames with frame deadlines
by Łukasz Jeż & Yishay Mansour & Boaz Patt-Shamir - 635-656 Staff and machine shift scheduling in a German potash mine
by Marco Schulze & Jürgen Zimmermann - 657-680 LP rounding and combinatorial algorithms for minimizing active and busy time
by Jessica Chang & Samir Khuller & Koyel Mukherjee - 681-693 Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence
by Azeddine Cheref & Alessandro Agnetis & Christian Artigues & Jean-Charles Billaut - 695-711 Fault tolerant scheduling of tasks of two sizes under resource augmentation
by Dariusz R. Kowalski & Prudence W. H. Wong & Elli Zavou
October 2017, Volume 20, Issue 5
- 423-442 Reordering buffer management with advice
by Anna Adamaszek & Marc P. Renault & Adi Rosén & Rob Stee - 443-457 Online interval scheduling with a bounded number of failures
by Marco Bender & Clemens Thielen & Stephan Westphal - 459-473 Mathematical models for the berth allocation problem in dry bulk terminals
by Andreas T. Ernst & Ceyda Oğuz & Gaurav Singh & Gita Taherkhani - 475-491 Finding an optimal Nash equilibrium to the multi-agent project scheduling problem
by Cyril Briand & Sandra Ulrich Ngueveu & Přemysl Šůcha - 493-506 Scheduling cleaning activities on trains by minimizing idle times
by Enrico Bartolini & Mauro Dell’Amico & Manuel Iori - 507-526 Crane scheduling in railway yards: an analysis of computational complexity
by Konrad Stephan & Nils Boysen - 527-542 Offline first-fit decreasing height scheduling of power loads
by Anshu Ranjan & Pramod Khargonekar & Sartaj Sahni
August 2017, Volume 20, Issue 4
- 313-335 Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
by Yunqiang Yin & T. C. E. Cheng & Du-Juan Wang & Chin-Chia Wu - 337-353 Non-preemptive buffer management for latency sensitive packets
by Moran Feldman & Joseph (Seffi) Naor - 355-372 An exact algorithm for parallel machine scheduling with conflicts
by Daniel Kowalczyk & Roel Leus - 373-389 An exact extended formulation for the unrelated parallel machine total weighted completion time problem
by Kerem Bülbül & Halil Şen - 391-422 A neighborhood for complex job shop scheduling problems with regular objectives
by Reinhard Bürgy
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
August 2016, Volume 19, Issue 4
- 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
April 2016, Volume 19, Issue 2
- 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 - 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