default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Scheduling, Volume 10
Volume 10, Number 1, February 2007
- Edmund K. Burke
, Michael L. Pinedo, Steef L. van de Velde:
Editorial. 3-4 - Jonathan F. Bard, Hadi W. Purnomo:
Cyclic preference scheduling of nurses using a Lagrangian-based heuristic. 5-23 - Luca Quadrifoglio, Maged M. Dessouky, Kurt Palmer:
An insertion heuristic for scheduling Mobility Allowance Shuttle Transit (MAST) services. 25-40 - Karthik Sourirajan, Reha Uzsoy:
Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication. 41-65 - Denise Sato Yamashita, Vinícius Amaral Armentano, Manuel Laguna:
Robust optimization models for project scheduling with resource availability cost. 67-76 - Xiaoqiang Cai, Xianyi Wu, Xian Zhou:
Single-machine scheduling with general costs under compound-type distributions. 77-84
Volume 10, Number 2, April 2007
- Jacek Blazewicz, Edmund K. Burke, Klaus Ecker, Erwin Pesch, Denis Trystram:
Selected papers from the Dagstuhl workshop. 85-86 - Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
A note on the two machine job shop with the weighted late work criterion. 87-95 - Albert Corominas, Wieslaw Kubiak, Natalia Moreno Palli:
Response time variability. 97-110 - Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos:
Time slot scheduling of compatible jobs. 111-127 - Adam Janiak, Tomasz Krysiak:
Single processor scheduling with job values depending on their completion times. 129-138 - Philippe Baptiste, Peter Brucker, Marek Chrobak, Christoph Dürr, Svetlana A. Kravchenko, Francis Sourd:
The complexity of mean flow time scheduling problems with release times. 139-146 - Dirk Christian Mattfeld:
Conference diary. 147-149
Volume 10, Number 3, June 2007
- Erik Demeulemeester, Willy Herroelen:
Introduction to the special issue: project scheduling under uncertainty. 151-152 - Francisco Ballestín:
When it is worthwhile to work with the stochastic RCPSP? 153-166 - Guidong Zhu, Jonathan F. Bard, Gang Yu:
A two-stage stochastic programming approach for project planning with uncertain activity durations. 167-180 - Izack Cohen, Boaz Golany, Avraham Shtub:
Resource allocation in stochastic, finite-capacity, multi-project systems through the cross entropy methodology. 181-193 - Stijn Van de Vonder, Erik Demeulemeester, Willy Herroelen:
A classification of predictive-reactive project scheduling procedures. 195-207 - Cyril Briand, Hoang Trung La, Jacques Erschler:
A robust approach for the single machine scheduling problem. 209-221 - Roel Leus, Willy Herroelen:
Scheduling for stability in single-machine production systems. 223-235
Volume 10, Numbers 4-5, 2007
- Byung-Cheon Choi, Suk-Hun Yoon:
Maximizing the weighted number of just-in-time jobs in flow shop scheduling. 237-243 - Mikel Lezaun, Gloria Pérez, Eduardo Sáinz de la Maza:
Rostering in a rail passenger carrier. 245-254 - Dvir Shabtay, George Steiner:
Single machine batch scheduling to minimize total completion time and resource consumption costs. 255-261 - Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza:
Semi on-line scheduling on three processors with known sum of the tasks. 263-269 - Kerem Bülbül, Philip M. Kaminsky, Candace A. Yano:
Preemption in single machine earliness/tardiness scheduling. 271-292 - Xiaoqiang Cai, Liming Wang, Xian Zhou:
Single-machine scheduling to stochastically minimize maximum lateness. 293-301 - Yong He, Qi Wei, T. C. E. Cheng:
Single-machine scheduling with trade-off between number of tardy jobs and compression cost. 303-310 - Mario Vanhoucke, Dieter Debels:
The discrete time/cost trade-off problem: extensions and heuristic procedures. 311-326 - Marcello Sammarra, Jean-François Cordeau, Gilbert Laporte, Maria Flavia Monaco:
A tabu search heuristic for the quay crane scheduling problem. 327-336 - Conference diary. 337-339
Volume 10, Number 6, December 2007
- Liron Yedidsion, Dvir Shabtay, Moshe Kaspi:
A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine. 341-352 - C. T. Ng, Mikhail Y. Kovalyov:
Batching and scheduling in a multi-machine flow shop. 353-364 - Rongheng Li, Huei Chuen Huang:
List scheduling for jobs with arbitrary release times and similar lengths. 365-373 - Véronique Bouffard, Jacques A. Ferland:
Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem. 375-386 - M. J. Bester, I. Nieuwoudt, Jan H. van Vuuren:
Finding good nurse duty schedules: a case study. 387-405 - Deshi Ye, Guochuan Zhang:
On-line scheduling of parallel jobs in a list. 407-413
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-07-03 23:54 CEST 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:
