default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Scheduling, Volume 24
Volume 24, Number 1, February 2021
- Edmund K. Burke:
Editorial: Journal of Scheduling (2020). 1-2 - Belinda Spratt
, Erhan Kozan:
An integrated rolling horizon approach to increase operating theatre efficiency. 3-25 - Christos Koulamas, George Steiner:
New results for scheduling to minimize tardiness on one machine with rejection and related problems. 27-34 - Alexandre Lemos, Pedro T. Monteiro, Inês Lynce:
Disruptions in timetables: a case study at Universidade de Lisboa. 35-48 - Xin Li, José A. Ventura, Kevin A. Bunn:
A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime. 49-68 - Rajesh Devaraj, Arnab Sarkar, Santosh Biswas:
Optimal work-conserving scheduler synthesis for real-time sporadic tasks using supervisory control of timed discrete-event systems. 69-82 - Michal Penn, Tal Raviv:
Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs. 83-102 - Felipe de la Rosa-Rivera, José I. Nuñez-Varela, César Augusto Puente Montejano, Sandra Edith Nava-Muñoz:
Measuring the complexity of university timetabling instances. 103-121
Volume 24, Number 2, April 2021
- Alexander Grigoriev, Vincent J. C. Kreuzen, Tim Oosterwijk:
Cyclic lot-sizing problems with sequencing costs. 123-135 - Shoufeng Ma, Hongming Li, Ning Zhu, Chenyi Fu:
Stochastic programming approach for unidirectional quay crane scheduling problem with uncertainty. 137-174 - Mohamed Habib Zahmani, Baghdad Atmani:
Multiple dispatching rules allocation in real time using data mining, genetic algorithms, and simulation. 175-196 - Inna G. Drobouchevitch:
Three-machine open shop with a bottleneck machine revisited. 197-208 - Bo Chen, Xiandong Zhang:
Scheduling coupled tasks with exact delays for minimum total job completion time. 209-221 - Mostafa Khatami, Amir Salehipour:
Coupled task scheduling with time-dependent processing times. 223-236 - Dimitrios Letsios, Jeremy T. Bradley, Suraj G, Ruth Misener, Natasha Page:
Approximate and robust bounded job start scheduling for Royal Mail delivery offices. 237-258
Volume 24, Number 3, June 2021
- Susumu Hashimoto, Shinji Mizuno:
A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource. 259-267 - Felix Hübner, Patrick Gerhards, Christian Stürck, Rebekka Volk:
Solving the nuclear dismantling project scheduling problem by combining mixed-integer and constraint programming techniques and metaheuristics. 269-290 - Jayanth Krishna Mogali, Joris Kinable, Stephen F. Smith, Zachary B. Rubinstein:
Scheduling for multi-robot routing with blocking and enabling constraints. 291-318 - Felix Happach:
Makespan minimization with OR-precedence constraints. 319-328 - Madiha Harrabi, Olfa Belkahla Driss, Khaled Ghédira:
A hybrid evolutionary approach to job-shop scheduling with generic time lags. 329-346 - Toni Ismael Wickert, Pieter Smet, Greet Vanden Berghe:
Quantifying and enforcing robustness in staff rostering. 347-366
Volume 24, Number 4, August 2021
- Dirk Briskorn:
Routing two stacking cranes with predetermined container sequences. 367-380 - Marek Chrobak, Mordecai J. Golin, Tak Wah Lam, Dorian Nogneng:
Scheduling with gaps: new models and algorithms. 381-403 - Antonina P. Khramova, Ilya Chernykh:
A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing. 405-412 - Luis F. Machado-Domínguez, Carlos D. Paternina-Arboleda, Jorge I. Vélez, Agustín Barrios Sarmiento:
A memetic algorithm to address the multi-node resource-constrained project scheduling problem. 413-429 - Arman Jabbari, Philip M. Kaminsky:
Online scheduling to minimize total weighted (modified) earliness and tardiness cost. 431-446 - Yuan Zhang, Jinjiang Yuan:
A note on the complexity of two supply chain scheduling problems. 447-454
Volume 24, Number 5, October 2021
- Jacek Blazewicz, Benjamin Moseley, Erwin Pesch, Denis Trystram, Guochuan Zhang:
New Perspectives in Scheduling Theory. 455-457 - Eric Angel, Evripidis Bampis, Vincent Chau, Vassilis Zissimopoulos:
Calibrations scheduling with arbitrary lengths and activation length. 459-467 - Emmanuel Jeannot, Guillaume Pallez, Nicolas Vidal:
Scheduling periodic I/O access with bi-colored chains: models and algorithms. 469-481 - Xin Chen, Sergey Kovalev, Malgorzata Sterna, Jacek Blazewicz:
Mirror scheduling problems with early work and late work criteria. 483-487 - Tomasz Ciesielczyk, Alberto Cabrera Pérez, Ariel Oleksiak, Wojciech Piatek, Grzegorz Waligóra, Francisco Almeida, Vicente Blanco Pérez:
An approach to reduce energy consumption and performance losses on heterogeneous servers using power capping. 489-505 - Maciej Drozdowski, Natalia V. Shakhlevich:
Scheduling divisible loads with time and cost constraints. 507-521 - Maroua Haddad, Jean-Marc Nicod, Marie-Cécile Péra, Christophe Varnier:
Stand-alone renewable power system scheduling for a green data center using integer linear programming. 523-541 - Gruia Calinescu, Kai Wang:
A new LP rounding algorithm for the active time problem. 543-552
Volume 24, Number 6, December 2021
- Baruch Mor, Gur Mosheiov, Dvir Shabtay:
Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates. 553-567 - Arianna Alfieri, Alessandro Druetto, Andrea Grosso, Fabio Salassa:
Column generation for minimizing total completion time in a parallel-batching environment. 569-588 - János Balogh, Leah Epstein, Asaf Levin:
More on ordered open end bin packing. 589-614 - Alejandro Reynoso, Nodari Vakhania:
Theoretical and practical issues in single-machine scheduling with two job release and delivery times. 615-647 - Tianyu Wang, Odile Bellenguez:
Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time. 649-662 - Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy, Julia Resch, Giovanni Righini:
Optimally rescheduling jobs with a Last-In-First-Out buffer. 663-680
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-01-10 18:21 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:
