default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Scheduling, Volume 18
Volume 18, Number 1, February 2015
- Edmund K. Burke
, Michael L. Pinedo:
Journal of Scheduling (2015). 1 - Sorina Dumitrescu, George Steiner, Rui Zhang:
Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs. 3-13 - Alessandro Agnetis, Cyril Briand, Jean-Charles Billaut, Premysl Sucha:
Nash equilibria for the multi-agent project scheduling problem with controllable processing times. 15-27 - Egbert van der Veen, Erwin W. Hans, Gerhard F. Post, Bart Veltman:
Shift rostering using decomposition: assign weekend shifts first. 29-43 - Jelle Duives, Birgit Heydenreich, Debasis Mishra, Rudolf Müller, Marc Uetz:
On optimal mechanism design for a sequencing problem. 45-59 - Tony Wauters, Katja Verbeeck, Patrick De Causmaecker, Greet Vanden Berghe:
A learning-based optimization approach to multi-project scheduling. 61-74 - Dvir Shabtay, Shlomo Karhi, Daniel Oron:
Multipurpose machine scheduling with rejection and identical job processing times. 75-88 - Simon Thevenin, Nicolas Zufferey, Marino Widmer:
Metaheuristics for a scheduling problem with rejection and tardiness penalties. 89-105 - Benjamin Moseley:
Scheduling to minimize energy and flow time in broadcast scheduling. 107-118
Volume 18, Number 2, April 2015
- Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Víctor Verdugo, Anke van Zuylen:
Split scheduling with uniform setup times. 119-129 - Alewyn P. Burger, C. G. Jacobs, Jan H. van Vuuren, Stephan Esterhuyse Visagie:
Scheduling multi-colour print jobs with sequence-dependent setup times. 131-145 - Jinjiang Yuan, C. T. Ng, T. C. Edwin Cheng:
Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness. 147-153 - Edward G. Coffman Jr., C. T. Ng, Vadim G. Timkovsky:
How small are shifts required in optimal preemptive schedules? 155-163 - Troels Martin Range, Richard Martin Lusby, Jesper Larsen:
Solving the selective multi-category parallel-servicing problem. 165-184 - Tianping Shuai, Donglei Du, Xiaoyue Jiang:
On-line preemptive machine scheduling with ℓp norm on two uniform machines. 185-194 - Claude 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. 195-205 - Sana Dahmen, Monia Rekik:
Solving multi-activity multi-day shift scheduling problems with a hybrid heuristic. 207-223
Volume 18, Number 3, June 2015
- Christian Artigues, Pierre Lopez:
Energetic reasoning for energy-constrained scheduling with a continuous resource. 225-241 - Alessandro Agnetis, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Scheduling two agent task chains with a central selection mechanism. 243-261 - Stefan Creemers:
Minimizing the expected makespan of a project with stochastic activity durations under resource constraints. 263-273 - Zdenek Hanzálek, Claire Hanen:
The impact of core precedences in a cyclic RCPSP with precedence delays. 275-284 - Jian-Jun Qi, Yajie Liu, Ping Jiang, Bo Guo:
Schedule generation scheme for solving multi-mode resource availability cost problem by modified particle swarm optimization. 285-298 - Odile Bellenguez-Morineau, Marek Chrobak, Christoph Dürr, Damien Prot:
A note on NP-hardness of preemptive mean flow-time scheduling for parallel machines. 299-304 - Kenneth R. Baker, Dan Trietsch:
Trading off due-date tightness and job tardiness in a basic scheduling model. 305-309 - Alan J. Soper:
A cyclical search for the two machine flow shop and open shop to minimise finishing time. 311-314 - Long Wan, Jinjiang Yuan, Zhichao Geng:
A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints. 315-323 - James D. Blocher, Sergey Sevastyanov:
A note on the Coffman-Sethi bound for LPT scheduling. 325-327 - Dvir Shabtay, Nufar Gaspar, Moshe Kaspi:
Erratum to: A survey on offline scheduling with rejection. 329 - Jaehwan Yang, Marc E. Posner:
Erratum to: Flow shops with WIP and value added costs. 331
Volume 18, Number 4, August 2015
- Jacek Blazewicz, Erwin Pesch, Denis Trystram, Guochuan Zhang:
New perspectives in scheduling theory. 333-334 - Yann Hendel, Wieslaw Kubiak, Denis Trystram:
Scheduling semi-malleable jobs to minimize mean flow time. 335-343 - Piotr Switalski, Franciszek Seredynski:
Scheduling parallel batch jobs in grids with evolutionary metaheuristics. 345-357 - Xiandong Zhang, Steef L. van de Velde:
Two-machine interval shop scheduling with time lags. 359-368 - Luke Muggy, Todd Easton:
Generating class schedules within a complex modular environment with application to secondary schools. 369-376 - Simon Kristiansen, Matias Sørensen, Thomas R. Stidsen:
Integer programming for the generalized high school timetabling problem. 377-392 - Nathaniel Kell, Jessen T. Havill:
Improved upper bounds for online malleable job scheduling. 393-410 - Weiya Zhong, Zhi-Long Chen:
Flowshop scheduling with interstage job transportation. 411-422 - Mikhail Y. Kovalyov, Ammar Oulamara, Ameur Soukhal:
Two-agent scheduling with agent specific batches on an unbounded serial batching machine. 423-434
Volume 18, Number 5, October 2015
- Fabio Furini, Martin Philip Kidd, Carlo Alfredo Persiani, Paolo Toth:
Improved rolling horizon approaches to the aircraft sequencing problem. 435-447 - René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller:
Interval scheduling and colorful independent sets. 449-469 - Maliheh Aramon Bajestani, J. Christopher Beck:
A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines. 471-486 - Iwo Bladek, Maciej Drozdowski, Frédéric Guinand, Xavier Schepler:
On contiguous and non-contiguous parallel task scheduling. 487-495 - Behzad Hezarkhani, Wieslaw Kubiak:
Decentralized subcontractor scheduling with divisible jobs. 497-511 - Yossef Luzon, Yariv N. Marmor, Eugene Khmelnitsky:
Optimal control of a two-server flow-shop network. 513-524 - Davide Giglio:
Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times. 525-543
Volume 18, Number 6, December 2015
- Marcin 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. 545-560 - Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir:
Real-time scheduling to minimize machine busy times. 561-573 - Bita Tadayon, J. Cole Smith:
Algorithms and Complexity Analysis for Robust Single-Machine Scheduling Problems. 575-592 - Arne Mensendiek:
Scheduling with returnable containers. 593-605 - Na Fu, Hoong Chuin Lau, Pradeep Varakantham:
Robust execution strategies for project scheduling with unreliable resources and stochastic durations. 607-622 - Hans Kellerer, Vladimir Kotov, Michaël Gabay:
An efficient algorithm for semi-online multiprocessor scheduling with given total processing time. 623-630 - Vassilissa Lehoux-Lebacque, Nadia Brauner, Gerd Finke:
Identical coupled task scheduling: polynomial complexity of the cyclic case. 631-644 - Ehab Morsy, Erwin Pesch:
Approximation algorithms for inventory constrained scheduling on a single machine. 645-653
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 2024-11-08 20:19 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:
