Volume 129,
Numbers 1-4,
July 2004
Models and Algorithms for Planning and Scheduling Problems
- Philippe Baptiste, Jacques Carlier, Alix Munier, Andreas S. Schulz:
Introduction.
17-19
- Mohamed Ali Aloulou, Mikhail Y. Kovalyov, Marie-Claude Portmann:
Maximization Problems in Single Machine Scheduling.
21-32
- Pascal Babu, Laurent Péridy, Eric Pinson:
A Branch and Bound Algorithm to Minimize Total Weighted Tardiness on a Single Processor.
33-46
- Evripidis Bampis, Rodolphe Giroudeau, Alexander Kononov:
Scheduling Tasks with Small Communication Delays for Clusters of Processors.
47-63
- Jacek Blazewicz, Maciej Machowiak, Jan Weglarz, Mikhail Y. Kovalyov, Denis Trystram:
Scheduling Malleable Tasks on Parallel Processors to Minimize the Makespan.
65-80
- Peter Brucker, Sigrid Knust, T. C. Edwin Cheng, Natalia V. Shakhlevich:
Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays.
81-106
- Edmund K. Burke, James P. Newall:
Solving Examination Timetabling Problems through Adaption of Heuristic Orderings.
107-134
- Zhi-Long Chen:
Simultaneous Job Scheduling and Resource Allocation on Parallel Machines.
135-153
- Paolo Dell'Olmo, Guglielmo Lulli:
Planning Activities in a Network of Logistic Platforms with Shared Resources.
155-169
- Jatinder N. D. Gupta, Christos Koulamas, George J. Kyparisis, Chris N. Potts, Vitaly A. Strusevich:
Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan.
171-185
- Mohamed Haouari, Anis Gharbi:
Lower Bounds for Scheduling on Identical Parallel Machines with Heads and Tails.
187-204
- Joanna Józefowska, Marek Mika, Rafal Rózycki, Grzegorz Waligóra, Jan Weglarz:
An Almost Optimal Heuristic for Preemptive Cmax Scheduling of Dependent Tasks on Parallel Identical Machines.
205-216
- Linet Özdamar, Ediz Ekinci, Beste Küçükyazici:
Emergency Logistics Planning in Natural Disasters.
217-245
- Maxim Sviridenko:
A Note on Permutation Flow Shop Problem.
247-252
- Nodari Vakhania:
Single-Machine Scheduling with Release Times and Tails.
253-271
Copyright © Sat Nov 28 22:25:50 2009
by Michael Ley (ley@uni-trier.de)
