Journal: J. Scheduling

Volume 18, Issue 6

545 -- 560Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Neil B. Dobbs, Tomasz Nowicki, Maxim Sviridenko, Grzegorz Swirszcz, Neal E. Young. Approximation algorithms for the joint replenishment problem with deadlines
561 -- 573Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir. Real-time scheduling to minimize machine busy times
575 -- 592Bita Tadayon, J. Cole Smith. Algorithms and Complexity Analysis for Robust Single-Machine Scheduling Problems
593 -- 605Arne Mensendiek. Scheduling with returnable containers
607 -- 622Na Fu, Hoong Chuin Lau, Pradeep Varakantham. Robust execution strategies for project scheduling with unreliable resources and stochastic durations
623 -- 630Hans Kellerer, Vladimir Kotov, Michaël Gabay. An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
631 -- 644Vassilissa Lehoux-Lebacque, Nadia Brauner, Gerd Finke. Identical coupled task scheduling: polynomial complexity of the cyclic case
645 -- 653Ehab Morsy, Erwin Pesch. Approximation algorithms for inventory constrained scheduling on a single machine

Volume 18, Issue 5

435 -- 447Fabio Furini, Martin Philip Kidd, Carlo Alfredo Persiani, Paolo Toth. Improved rolling horizon approaches to the aircraft sequencing problem
449 -- 469René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller. Interval scheduling and colorful independent sets
471 -- 486Maliheh Aramon Bajestani, J. Christopher Beck. A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines
487 -- 495Iwo Bladek, Maciej Drozdowski, Frédéric Guinand, Xavier Schepler. On contiguous and non-contiguous parallel task scheduling
497 -- 511Behzad Hezarkhani, Wieslaw Kubiak. Decentralized subcontractor scheduling with divisible jobs
513 -- 524Yossef Luzon, Yariv Marmor, Eugene Khmelnitsky. Optimal control of a two-server flow-shop network
525 -- 543Davide Giglio. Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times

Volume 18, Issue 4

333 -- 334Jacek Blazewicz, Erwin Pesch, Denis Trystram, Guochuan Zhang. New perspectives in scheduling theory
335 -- 343Yann Hendel, Wieslaw Kubiak, Denis Trystram. Scheduling semi-malleable jobs to minimize mean flow time
345 -- 357Piotr Switalski, Franciszek Seredynski. Scheduling parallel batch jobs in grids with evolutionary metaheuristics
359 -- 368Xiandong Zhang, Steef L. van de Velde. Two-machine interval shop scheduling with time lags
369 -- 376Luke Muggy, Todd Easton. Generating class schedules within a complex modular environment with application to secondary schools
377 -- 392Simon Kristiansen, Matias Sørensen, Thomas R. Stidsen. Integer programming for the generalized high school timetabling problem
393 -- 410Nathaniel Kell, Jessen T. Havill. Improved upper bounds for online malleable job scheduling
411 -- 422Weiya Zhong, Zhi-Long Chen. Flowshop scheduling with interstage job transportation
423 -- 434Mikhail Y. Kovalyov, Ammar Oulamara, Ameur Soukhal. Two-agent scheduling with agent specific batches on an unbounded serial batching machine

Volume 18, Issue 3

225 -- 241Christian Artigues, Pierre Lopez. Energetic reasoning for energy-constrained scheduling with a continuous resource
243 -- 261Alessandro Agnetis, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy. Scheduling two agent task chains with a central selection mechanism
263 -- 273Stefan Creemers. Minimizing the expected makespan of a project with stochastic activity durations under resource constraints
275 -- 284Zdenek Hanzálek, Claire Hanen. The impact of core precedences in a cyclic RCPSP with precedence delays
285 -- 298Jian-Jun Qi, Yajie Liu, Ping Jiang, Bo Guo. Schedule generation scheme for solving multi-mode resource availability cost problem by modified particle swarm optimization
299 -- 304Odile Bellenguez-Morineau, Marek Chrobak, Christoph Dürr, Damien Prot. A note on NP-hardness of preemptive mean flow-time scheduling for parallel machines
305 -- 309Kenneth R. Baker, Dan Trietsch. Trading off due-date tightness and job tardiness in a basic scheduling model
311 -- 314Alan J. Soper. A cyclical search for the two machine flow shop and open shop to minimise finishing time
315 -- 323Long Wan, Jinjiang Yuan, Zhichao Geng. A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
325 -- 327James D. Blocher, Sergey Sevastyanov. A note on the Coffman-Sethi bound for LPT scheduling
329 -- 0Dvir Shabtay, Nufar Gaspar, Moshe Kaspi. Erratum to: A survey on offline scheduling with rejection
331 -- 0Jaehwan Yang, Marc E. Posner. Erratum to: Flow shops with WIP and value added costs

Volume 18, Issue 2

119 -- 129Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Víctor Verdugo, Anke van Zuylen. Split scheduling with uniform setup times
131 -- 145Alewyn P. Burger, C. G. Jacobs, Jan H. van Vuuren, S. E. Visagie. Scheduling multi-colour print jobs with sequence-dependent setup times
147 -- 153J. J. Yuan, C. T. Ng, T. C. Edwin Cheng. Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness
155 -- 163Edward G. Coffman Jr., C. T. Ng, Vadim G. Timkovsky. How small are shifts required in optimal preemptive schedules?
165 -- 184Troels Martin Range, Richard Martin Lusby, Jesper Larsen. Solving the selective multi-category parallel-servicing problem
185 -- 194Tianping Shuai, Donglei Du, Xiaoyue Jiang. On-line preemptive machine scheduling with $$\ell _p$$ ℓ p norm on two uniform machines
195 -- 205Claude Yugma, Jakey Blue, Stéphane Dauzère-Pérès, Ali Obeid. Integration of scheduling and advanced process control in semiconductor manufacturing: review and outlook
207 -- 223Sana Dahmen, Monia Rekik. Solving multi-activity multi-day shift scheduling problems with a hybrid heuristic

Volume 18, Issue 1

1 -- 0Edmund K. Burke, Michael Pinedo. Journal of Scheduling (2015)
3 -- 13Sorina Dumitrescu, George Steiner, Rui Zhang. Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs
15 -- 27Alessandro Agnetis, Cyril Briand, Jean-Charles Billaut, Premysl Sucha. Nash equilibria for the multi-agent project scheduling problem with controllable processing times
29 -- 43Egbert van der Veen, Erwin W. Hans, Gerhard F. Post, Bart Veltman. Shift rostering using decomposition: assign weekend shifts first
45 -- 59Jelle Duives, Birgit Heydenreich, Debasis Mishra, Rudolf Müller, Marc Uetz. On optimal mechanism design for a sequencing problem
61 -- 74Tony Wauters, Katja Verbeeck, Patrick De Causmaecker, Greet Vanden Berghe. A learning-based optimization approach to multi-project scheduling
75 -- 88Dvir Shabtay, Shlomo Karhi, Daniel Oron. Multipurpose machine scheduling with rejection and identical job processing times
89 -- 105Simon Thevenin, Nicolas Zufferey, Marino Widmer. Metaheuristics for a scheduling problem with rejection and tardiness penalties
107 -- 118Benjamin Moseley. Scheduling to minimize energy and flow time in broadcast scheduling