default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Scheduling, Volume 28
Volume 28, Number 1, February 2025
- Ehsan Saeedizade
, Mehrdad Ashtiani:
Scientific workflow scheduling algorithms in cloud environments: a comprehensive taxonomy, survey, and future directions. 1-63 - Roel J. J. Brouwer, Marjan van den Akker, Han Hoogeveen:
A hybrid local search algorithm for the continuous energy-constrained scheduling problem. 65-84 - Fernando Garza-Santisteban, Jorge Mario Cruz-Duarte, Iván Amaya, José Carlos Ortiz-Bayliss, Santiago Enrique Conant-Pablos, Hugo Terashima-Marín:
Selection hyper-heuristics and job shop scheduling problems: How does instance size influence performance? 85-99 - Dirk Briskorn, Nils Boysen, Lennart Zey:
Scheduling of e-commerce packaging machines: blocking machines and their impact on the performance-waste tradeoff. 101-120 - Péter Györgyi, Tamás Kis, Evelin Szögi:
On variants of a load-balancing problem with unit-load jobs. 121-138 - Martin Koutecký, Johannes Zink:
Complexity of scheduling few types of jobs on related and unrelated machines. 139-156
Volume 28, Number 2, April 2025
- Ender Özcan, Patrick De Causmaecker, Greet Vanden Berghe, Dries R. Goossens:
Preface: the practice and theory of automated timetabling (2022). 157-158 - Bernd Bassimir, Rolf Wanka:
On the computation of robust examination timetables: methods and experimental results. 159-181 - Angelos Dimitsas, Christos Gogos, Christos Valouxis, Vasileios Nastos, Panayiotis Alefragis:
A proven optimal result for a benchmark instance of the uncapacitated examination timetabling problem. 183-194 - Matthew Davison, Ahmed Kheiri, Konstantinos G. Zografos:
Modelling and solving the university course timetabling problem with hybrid teaching considerations. 195-215 - David Van Bulck, Dries R. Goossens, Andrea Schaerf:
Multi-neighbourhood simulated annealing for the ITC-2007 capacitated examination timetabling problem. 217-232 - Eugenia Zanazzo, Sara Ceschia, Agostino Dovier, Andrea Schaerf:
Solving the medical student scheduling problem using simulated annealing. 233-246 - Tomás Müller, Hana Rudová, Zuzana Müllerová:
Real-world university course timetabling at the International Timetabling Competition 2019. 247-267
Volume 28, Number 3, June 2025
- Matthew Bold, Marc Goerigk:
Recoverable robust single machine scheduling with polyhedral uncertainty. 269-287 - Jakob Snauwaert, Mario Vanhoucke:
A solution framework for multi-skilled project scheduling problems with hierarchical skills. 289-310 - K. Pregina, M. Ramesh Kannan:
A graphical evaluation and review technique for scheduling construction projects. 311-328 - Jan Schoenfelder, Jakob Heins, Jens O. Brunner:
Task assignments with rotations and flexible shift starts to improve demand coverage and staff satisfaction in healthcare. 329-353 - Piyoosh Purushothaman Nair, Hareesh Reddi, Rajesh Devaraj, Arnab Sarkar:
Hybrid-sched: a QoS adaptive offline-online scheduler for real-time tasks on multi-cores. 355-375
Volume 28, Number 5, October 2025
- Elena Rener, Fabio Salassa, Vincent T'kindt:
Single machine rescheduling for new orders with maximum and total time disruption constraints. 469-482 - Fangfang Cao, Tom Servranckx, Zhengwen He, Mario Vanhoucke:
A buffer allocation evolutionary algorithm for resource-constrained projects with activity clusters. 483-511 - Mingyang Gong, Jing Fan, Guohui Lin, Bing Su, Zihan Su, Xiang Zhang:
Multiprocessor scheduling with testing: improved online algorithms and numerical experiments. 513-527 - Oliver Braun, Fan Chung, Ronald L. Graham:
Lower bounds for online scheduling on four processors. 529-544 - Rafael Calegari, Flavio S. Fogliatto, Filipe R. Lucini, João B. G. de Brito, Gabrielli Harumi Yamashita, Michel J. Anzanello, Guilherme Luz Tortorella, Beatriz D. Schaan:
Designing a long-term master surgical timetable: a case study in balancing post-operative ward bed demand and minimizing changes in surgical schedules. 545-562
Volume 28, Number 6, December 2025
- Byung-Cheon Choi, Myoung-Ju Park, Kyung Min Kim:
Two-machine permutation flow shop scheduling with generalized due dates to minimize total late work. 563-576 - Pasquale Avella, Maurizio Boccia, Carlo Mannino, Michele Mele, Sandro Viglione:
A cut-and-branch algorithm for the external candidates examination scheduling problem. 577-584 - Maximilian von Aspern, Felix Buld, Nicklas Klein, Michael L. Pinedo:
Flow shops with reentry: The total weighted completion time objective. 585-600 - Ali Amiri, Reza Barkhi:
Scheduling web banner advertisements with conflicts and time windows: a column generation-based solution approach. 601-613 - Enguang Guan, Jiahui Wang, Jianguo Duan:
Sustainable scheduling for a flexible job shop considering batch processing and batch transportation strategies. 615-637
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-12-12 22:53 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:
