default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Scheduling, Volume 21
Volume 21, Number 1, February 2018
- Edmund K. Burke
, Michael L. Pinedo:
Journal of Scheduling (2018). 1 - Damien Prot, Odile Bellenguez-Morineau:
A survey on how the structure of precedence constraints may change the complexity class of scheduling problems. 3-16 - Gréanne Leeftink, Erwin W. Hans:
Case mix classification and a benchmark set for surgery scheduling. 17-33 - Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Maxim Sviridenko:
Energy-efficient scheduling and routing via randomized rounding. 35-51 - Aurélien Froger, Michel Gendreau, Jorge E. Mendoza, Eric Pinson, Louis-Martin Rousseau:
Solving a wind turbine maintenance scheduling problem. 53-76 - Ernst Althaus, André Brinkmann, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers, Jirí Sgall, Tim Süß:
Scheduling shared continuous resources on many-cores. 77-92 - Emilio Zamorano, Annika Becker, Raik Stolletz:
Task assignment with start time-dependent processing times for personnel at check-in counters. 93-109 - Nils Boysen, Dirk Briskorn, Simon Emde:
Scheduling electric vehicles and locating charging stations on a path. 111-126 - Jelke J. van Hoorn:
The Current state of bounds on benchmark instances of the job-shop scheduling problem. 127-128
Volume 21, Number 2, April 2018
- Zdenek Hanzálek, Graham Kendall, Barry McCollum, Premysl Sucha, Greet Vanden Berghe:
Preface. 129-130 - Adrian Zimmermann, Norbert Trautmann:
A list-scheduling heuristic for the short-term planning of assessment centers. 131-142 - Jonas Ingels, Broos Maenhout:
The impact of overtime as a time-based proactive scheduling and reactive allocation strategy on the robustness of a personnel shift roster. 143-165 - Tom Rihm, Philipp Baumann:
Staff assignment with lexicographically ordered acceptance levels. 167-189 - Julia Lange, Frank Werner:
Approaches to modeling train scheduling problems as job-shop problems with blocking constraints. 191-207 - Yi Tan, Lars Mönch, John W. Fowler:
A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines. 209-226 - Lei Shang, Christophe Lenté, Mathieu Liedloff, Vincent T'kindt:
Exact exponential algorithms for 3-machine flowshop scheduling problems. 227-233 - Liji Shen, Jatinder N. D. Gupta:
Family scheduling with batch availability in flow shops to minimize makespan. 235-249 - Tony T. Tran, Meghana Padmanabhan, Peter Yun Zhang, Heyse Li, Douglas G. Down, J. Christopher Beck:
Multi-stage resource-aware scheduling for data centers with heterogeneous servers. 251-267
Volume 21, Number 3, June 2018
- Leah Epstein:
A survey on makespan minimization in semi-online environments. 269-284 - Sana Dahmen, Monia Rekik, François Soumis:
An implicit model for multi-activity shift scheduling problems. 285-304 - Christoph Dürr, Zdenek Hanzálek, Christian Konrad, Yasmina Seddik, René Sitters, Óscar C. Vásquez, Gerhard J. Woeginger:
The triangle scheduling problem. 305-312 - Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Shalmoli Gupta, Sambuddha Roy, Yogish Sabharwal:
Improved algorithms for resource allocation under varying capacity. 313-325 - Hadas Shachnai, Ariella Voloshin, Shmuel Zaks:
Flexible bandwidth assignment with application to optical networks. 327-336 - Jianming Dong, Xueshi Wang, Jueliang Hu, Guohui Lin:
Single machine scheduling with job delivery to multiple customers. 337-348 - Salim Rostami, Stefan Creemers, Roel Leus:
New strategies for stochastic resource-constrained project scheduling. 349-365 - Lunce Fu, Maged M. Dessouky:
Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem. 367-386
Volume 21, Number 4, August 2018
- Bailin Wang, Kai Huang, Tieke Li:
Two-stage hybrid flowshop scheduling with simultaneous processing machines. 387-411 - Helga Ingimundardottir, Thomas Philip Runarsson:
Discovering dispatching rules from data using imitation learning: A case study for the job-shop problem. 413-428 - Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Online-bounded analysis. 429-441 - Liang-Liang Fu, Mohamed Ali Aloulou, Christian Artigues:
Integrated production and outbound distribution scheduling problems with job release dates and deadlines. 443-460 - Zhijun Xu, Dehua Xu:
Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time. 461-482
Volume 21, Number 5, October 2018
- Manzhan Gu, Jinwei Gu, Xiwen Lu:
An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines. 483-492 - Dusan Knop, Martin Koutecký:
Scheduling meets n-fold integer programming. 493-503 - Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich, Bernhard Primas:
Models and algorithms for energy-efficient scheduling with immediate start of jobs. 505-516 - Douglas S. Altner, Anthony C. Rojas, Leslie D. Servi:
A two-stage stochastic program for multi-shift, multi-analyst, workforce optimization with multiple on-call options. 517-531 - Patrick Eugster, Alexander Kesselman, Kirill Kogan, Sergey I. Nikolenko, Alexander Sirotkin:
Admission control in shared memory switches. 533-543 - Pan Zou, Manik Rajora, Steven Y. Liang:
A new algorithm based on evolutionary computation for hierarchically coupled constraint optimization: methodology and application to assembly job-shop scheduling. 545-563 - Wenchang Luo, Taibo Luo, Randy Goebel, Guohui Lin:
Rescheduling due to machine disruption to minimize the total weighted completion time. 565-578
Volume 21, Number 6, December 2018
- Nicholas G. Hall, Yumei Huo, Benjamin Li, Michael L. Pinedo, Hairong Zhao:
In memoriam: Dr. Joseph Leung. 579-580 - Jacek Blazewicz, Benjamin Moseley, Erwin Pesch, Denis Trystram, Guochuan Zhang:
New challenges in scheduling theory. 581-582 - Dariusz Dereniowski, Wieslaw Kubiak:
Shared processor scheduling. 583-593 - Dominik Kress, Maksim Barketau, Erwin Pesch:
Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines. 595-606 - Marjan van den Akker, Han Hoogeveen, Judith Stoef:
Combining two-stage stochastic programming and recoverable robustness to minimize the number of late jobs in the case of uncertain processing times. 607-617 - Kai Wang, Vincent Chau, Minming Li:
Scheduling fully parallel jobs. 619-631 - Weiwei Wu, Minming Li, Kai Wang, He Huang, Enhong Chen:
Speed scaling problems with memory/cache consideration. 633-646 - Deshi Ye, Danny Z. Chen, Guochuan Zhang:
Online scheduling of moldable parallel tasks. 647-654
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-21 19:38 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
