Journal: J. Scheduling

Volume 24, Issue 6

553 -- 567Baruch Mor, Gur Mosheiov, Dvir Shabtay. Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates
569 -- 588Arianna Alfieri, Alessandro Druetto, Andrea Grosso, Fabio Salassa. Column generation for minimizing total completion time in a parallel-batching environment
589 -- 614János Balogh, Leah Epstein, Asaf Levin. More on ordered open end bin packing
615 -- 647Alejandro Reynoso, Nodari Vakhania. Theoretical and practical issues in single-machine scheduling with two job release and delivery times
649 -- 662Tianyu Wang 0005, Odile Bellenguez. Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time
663 -- 680Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy, Julia Resch, Giovanni Righini. Optimally rescheduling jobs with a Last-In-First-Out buffer

Volume 24, Issue 5

455 -- 457Jacek Blazewicz, Benjamin Moseley, Erwin Pesch, Denis Trystram, Guochuan Zhang. New Perspectives in Scheduling Theory
459 -- 467Eric Angel, Evripidis Bampis, Vincent Chau, Vassilis Zissimopoulos. Calibrations scheduling with arbitrary lengths and activation length
469 -- 481Emmanuel Jeannot, Guillaume Pallez, Nicolas Vidal. Scheduling periodic I/O access with bi-colored chains: models and algorithms
483 -- 487Xin Chen, Sergey Kovalev, Malgorzata Sterna, Jacek Blazewicz. Mirror scheduling problems with early work and late work criteria
489 -- 505Tomasz 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
507 -- 521Maciej Drozdowski, Natalia V. Shakhlevich. Scheduling divisible loads with time and cost constraints
523 -- 541Maroua Haddad 0002, 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
543 -- 552Gruia Calinescu, Kai Wang 0018. A new LP rounding algorithm for the active time problem

Volume 24, Issue 4

367 -- 380Dirk Briskorn. Routing two stacking cranes with predetermined container sequences
381 -- 403Marek Chrobak, Mordecai J. Golin, Tak Wah Lam, Dorian Nogneng. Scheduling with gaps: new models and algorithms
405 -- 412Antonina P. Khramova, Ilya Chernykh. A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing
413 -- 429Luis 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
431 -- 446Arman Jabbari, Philip M. Kaminsky. Online scheduling to minimize total weighted (modified) earliness and tardiness cost
447 -- 454Yuan Zhang, Jinjiang Yuan. A note on the complexity of two supply chain scheduling problems

Volume 24, Issue 3

259 -- 267Susumu Hashimoto, Shinji Mizuno. A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource
269 -- 290Felix 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
291 -- 318Jayanth Krishna Mogali, Joris Kinable, Stephen F. Smith, Zachary B. Rubinstein. Scheduling for multi-robot routing with blocking and enabling constraints
319 -- 328Felix Happach. Makespan minimization with OR-precedence constraints
329 -- 346Madiha Harrabi, Olfa Belkahla Driss, Khaled Ghédira. A hybrid evolutionary approach to job-shop scheduling with generic time lags
347 -- 366Toni Ismael Wickert, Pieter Smet, Greet Vanden Berghe. Quantifying and enforcing robustness in staff rostering

Volume 24, Issue 2

123 -- 135Alexander Grigoriev, Vincent J. C. Kreuzen, Tim Oosterwijk. Cyclic lot-sizing problems with sequencing costs
137 -- 174Shoufeng Ma, Hongming Li, Ning Zhu, Chenyi Fu. Stochastic programming approach for unidirectional quay crane scheduling problem with uncertainty
175 -- 196Mohamed Habib Zahmani, Baghdad Atmani. Multiple dispatching rules allocation in real time using data mining, genetic algorithms, and simulation
197 -- 208Inna G. Drobouchevitch. Three-machine open shop with a bottleneck machine revisited
209 -- 221Bo Chen 0002, Xiandong Zhang. Scheduling coupled tasks with exact delays for minimum total job completion time
223 -- 236Mostafa Khatami, Amir Salehipour. Coupled task scheduling with time-dependent processing times
237 -- 258Dimitrios Letsios, Jeremy T. Bradley, Suraj G, Ruth Misener, Natasha Page. Approximate and robust bounded job start scheduling for Royal Mail delivery offices

Volume 24, Issue 1

1 -- 2Edmund K. Burke. Editorial: Journal of Scheduling (2020)
3 -- 25Belinda Spratt, Erhan Kozan. An integrated rolling horizon approach to increase operating theatre efficiency
27 -- 34Christos Koulamas, George Steiner. New results for scheduling to minimize tardiness on one machine with rejection and related problems
35 -- 48Alexandre Lemos, Pedro T. Monteiro, Inês Lynce. Disruptions in timetables: a case study at Universidade de Lisboa
49 -- 68Xin Li, José A. Ventura, Kevin A. Bunn. A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime
69 -- 82Rajesh Devaraj, Arnab Sarkar, Santosh Biswas. Optimal work-conserving scheduler synthesis for real-time sporadic tasks using supervisory control of timed discrete-event systems
83 -- 102Michal Penn, Tal Raviv. Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs
103 -- 121Felipe 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