| Invited Lectures |
| J. Carlier |
RCPSP AND CUMULATIVE SCHEDULING PROBLEMS |
| E.G. Coffman, Jr. |
IDEAL PREEMPTIVE SCHEDULES |
| G. Finke |
SCHEDULING ON BATCHING MACHINES |
| C. Potts |
LOCAL SEARCH FOR SCHEDULING:THEORY AND PRACTICE |
| A.Schulz |
FROM LINEAR PROGRAMMING RELAXATIONS TO APPROXIMATION ALGORITHMS: A TOUR D'HORIZON |
| G. Woeginger |
FAIR DIVISION OF A SHARED RESOURCE |
| Regular Talks |
| J. Aerts; J. Korst; F. Spieksma |
APPROXIMATION OF A RETRIEVAL PROBLEM IN INTERNET SERVERS |
| A. Agnetis; A. Alfieri; G. Nicosia |
A COLUMN GENERATION APPROACH TO A CLASS OF SINGLE-MACHINE PREEMPTIVE SCHEDULING PROBLEMS |
| M. van den Akker; K. De Bontridder; R. van Geel; H. Hoogeveen |
SIMULATION OF A JOB SHOP SCHEDULING STRATEGY |
| M. van den Akker; H. Hoogeveen |
ACCEPT OR REJECT IN A STOCHASTIC ENVIRONMENT |
| E. M. Arkin; M. A. Bender; S. P. Fekete; S. He; J. S. B. Mitchell; M. Skutella; M. O. Sztainberg |
THE FREEZE-TAG SCHEDULING PROBLEM: HOW TO AWAKEN A SWARM OF ROBOTS |
| E. Bampis; A. Kononov |
ON THE APPROXIMATION OF THE UET-UCT BICRITERIA SCHEDULING PROBLEM |
| N. Bansal; A. Blum; S. Chawla; K. Dhamdhere |
SCHEDULING FOR FLOW-TIME WITH ADMISSION CONTROL |
| P. Baptiste; M. Sviridenko |
STRUCURAL PROPERTIES OF PREEMPTIVE PARALLEL MACHINE SCHEDULES |
| J. Blazewicz; E. Pesch; M. Sterna; F. Werner |
DYNAMIC PROGRAMMING FOR 2-MACHINE SHOP PROBLEMS WITH WEIGHTED LATE WORK CRITERION |
| J. Boyar; L. M. Favrholdt |
THE RELATIVE WORST ORDER RATIO FOR ON-LINE ALGORITHMS |
| P. Brucker; S. Heitmann; C. Strotmann |
THE RCPSP WITH TIME-DEPENDENTRE SOURCE AVAILABILITIES AND ITS APPLICATIONS |
| P. Brucker; T. Kampmeyer |
TABU SEARCH ALGORITHMS FOR CYCLIC MACHINE SCHEDULING PROBLEMS |
| P. Brucker; M. Kovalyov |
COMPLEX JOB-SHOP SCHEDULING PROBLEMS |
| B. Chen; Y. Ye; J. Zhang |
LOT-SIZING SCHEDULING WITH BATCH SETUP TIMES |
| A. Coja-Oghlan; T. Nierhoffy; S. O. Krumke |
SCHEDULING A SERVER ON A CATERPILLAR NETWORK –A PROBABILISTIC ANALYSIS |
| O. Daescu; D. Soeder; R. N. Uma |
APPROXIMATION BOUNDS FOR SCHEDULING PROBLEMS UNDER TRANSPORTATION CONSTRAINTS |
| F. Della Croce; A. Grosso; V. Th. Paschos |
LOWER BOUNDS ON THE APPROXIMATION RATIOS OF LEADING HEURISTICS FOR THE SINGLE MACHINE TOTAL TARDINESS PROBLEM |
| M. Drozdowski; P. Wolniewicz |
MULTIINSTALLMENT VERSUS OUT-OF-CORE DIVISIBLE LOAD PROCESSING |
| L. Epstein |
SEMIONLINE SCHEDULING ON TWO RELATED MACHINES: TIGHT, TIGHTER, TIGHTEST |
| M. H. Goldwasser |
A SURVEY FOR MAXIMIZING RESOURCE UTILIZATION THROUGH ADMISSION CONTROL |
| K., I-J. Ho; J., Y-T. Leung |
SCHEDULING IMPRECISE COMPUTATION TASKS TO MINIMIZEA DUAL CRITERIA OBJECTIVE |
| B. Kalyanasundaram; M. Velauthapillai |
EFFECTS OF MIGRATION AND LOSS OF CHANNELS IN VARIABLE DATA RATE ENVIORONMENTS |
| Ch. Keung Poon; W. Yu |
MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING |
| J. Korst; J. van Gassel; R. Wijnands |
SCHEDULING BUFFER REFILLS IN PORTABLE MULTIMEDIA STORAGE |
| M. Kubale; A. Nadolski |
CHROMATIC SCHEDULING IN CYCLICAL OPEN SHOP |
| W. Kubiak |
THE LIU-LAYLAND PROBLEM REVISITED |
| M. A. Kubzin; C. N. Potts; V. A. Strusevich |
APPROXIMATION SCHEMES FOR THE FLOW SHOP SCHEDULING PROBLEMS WITH NON-AVAILABILITY CONSTRAINTS |
| P. Lemaire; G. Finke; N. Brauner |
AN APPROXIMATION SCHEME FOR THE PACKING OF MULTIBIN OBJECTS |
| F. Mangione; N. Brauner; B. Penz |
DEGREE OF THE DOMINANT CYCLES IN NO-WAIT ROBOTIC CELLS |
| W. Michiels; J. Korst |
WORST-CASE PERFORMANCE OF THE DIFFERENCING METHOD FOR MULTIPROCESSOR SCHEDULING |
| A. Munier-Kordon |
VARIANTS OF THE TWO-MACHINES FLOW-SHOP WITH PRECEDENCE CONSTRAINTS |
| C. Oguz; M. F. Ercan |
A COMPARISON OF LOCAL SEARCH ALGORITHMS FOR SCHEDULING MULTIPROCESSOR TASKS |
| K. R. Pruhs |
POWER MANAGEMENT |
| F. Sourd |
PREEMPTIVE AND NON-PREEMPTIVE SCHEDULING WITH IRREGULAR COSTFUNCTIONS |
| R. van Stee; H. La Poutr´e |
MINIMIZING THE TOTAL COMPLETION TIME ON-LINE ON A SINGLE MACHINE, USING RESTARTS |
| S. Voß; A. Witt |
FLEXIBLE FLOW SHOP SCHEDULING WITH BATCHING REQUIREMENTS AND LIMITED INTERMEDIATE STORAGE |
| Spotlight Talks |
| A. Abdekhodaee; S. Dunstall; A. T. Ernst; M. Krishnamoorthy; R. Kowalczyk; N. Powell |
ON SCHEDULING AND ROSTERING IN DEMAND-DRIVEN RAIL TRANSPORT SYSTEMS |
| A. Agnetis; G. Ciaschetti; P. Detti |
SCHEDULING DIFFERENT SERVICES IN TD-CDMA UMTS |
| C. Artigues |
ORDERED GROUP ASSIGNMENT OF JOBS TO MAXIMISE EXIBILITY IN ROBUST SCHEDULING: MODELS AND POLYNOMIAL ALGORITHMS |
| C. Blum |
COMBINING ANT COLONY OPTIMIZATION WITH BEAM SEARCH TO SOLVE SHOP SCHEDULING PROBLEMS |
| E. den Boef; D. den Hertog |
SCHEDULING VARIABLEBITRATE DATA TO MINIMIZE TOTAL RESOURCE COSTS |
| N. Brahimi; S. Dauzere-Peres; N. Najid |
A LAGRANGIAN RELAXATION HEURISTIC FOR THE CAPACITATED SINGLE ITEM LOT SIZING PROBLEM WITH TIME WINDOWS |
| H. Brasel; N. Shakhlevich |
LISA - FIT FOR COOPERATIVE DEVELOPMENT |
| P. Brucker; S. Heitmann; J. Hurink; T. Nieberg |
JOB-SHOP SCHEDULING WITH BUFFERS |
| P. Dell’Olmo; A. Iovanella; G. Lulli |
HEURISTIC APPROACH TO STOCHASTIC MULTIPROCESSORTASK SCHEDULING |
| F. Drews; K. H. Ecker; O. Kao; S. Schomann |
AN EVOLUTIONARY ALGORITHM FOR WORKLOAD BALANCING IN PARALLEL IMAGE DATABASES |
| M. Ebbe; M. van der Heiden; J. Hurink; M. Schutten |
SCHEDULING VEHICLES IN AN UNDERGROUND CARGO TRANSPORTATION SYSTEM (PART 1 + 2) 2xspot |
| A. Elkhyari; C. Gu´eret; N. Jussien |
SOLVING DYNAMIC RCPSP USING EXPLANATION-BASED CONSTRAINT PROGRAMMING |
| M-L. Espinouse; M. Jacomino; M. Sbihi |
SCHEDULING JOBS AND ONE TIME-DEPENDENT UNAVAILABILITY PERIOD ON ONE MACHINE |
| C. Esswein; J.-C. Billaut |
JOB SHOP SCHEDULING WITH FLEXIBILITY |
| B. Esteve; C. Aubijoux; A. Chartier; V. T'Kindt |
A RECOVERING BEAM SEARCH ALGORITHM FOR THE SINGLE MACHINE JUST-IN-TIME SCHEDULING PROBLEM |
| M. Ghirardi |
MAKESPAN MINIMISATION ON UNRELATED PARALLEL MACHINES: A RECOVERING BEAM SEARCH APPROACH |
| M. H. Goldwasser; B. Kerbikov |
ADMISSION CONTROL WITH IMMEDIATE NOTIFICATION |
| A. Grigoriev; V. A. Strusevich |
DEDICATED PARALLEL MACHINES SCHEDULING WITH A SINGLE SPEEDING-UP RESOURCE |
| V. Ha Do; C. Hanen;Y. Zinder |
SCHEDULING UET TASKS AND PREEMPTIVE TASKS ON PARALLEL PROCESSORS UNDER THE RESTRICTION OF PRECEDENCE CONSTRAINTS |
| V. Jost; N. Brauner; W. Kubiak |
ON SMALL DEVIATION CONJECTURE FOR JIT SCHEDULING |
| J. Jozefowska; M.Mika; R.Rozycki; G.Waligora; J.Weglarz |
SENSITIVITY ISSUES IN DISCRETE-CONTINUOUS SCHEDULING |
| T. Kis |
A BRANCH-AND-CUT APPROACH FOR SCHEDULING OF PROJECTS WITH VARIABLE-INTENSITY ACTIVITIES |
| M. A. Kubzin; V. A. Strusevich; J. Breit; G. Schmidt |
THE OPEN SHOP SCHEDULING PROBLEM WITH NON-AVAILABILITY CONSTRAINTS: POLYNOMIAL-TIME APPROXIMATION SCHEMES |
| A. Lazarev; A. Kvaratskhelia |
METHODS TO RESEARCH PROBLEM OF SCHEDULING THEORY MINIMIZING TOTAL TARDINESS ON SINGLE MACHINE 1||STj |
| Y. Mati; X. Xie |
THE TWO-JOB SHOP SCHEDULING PROBLEM WITH MULTI-PURPOSE MACHINES AND BLOCKING CONSTRAINTS |
| P. Mauguière; J-L. Bouquard; J-C. Billaut |
A BRANCH AND BOUND ALGORITHM FOR A JOB SHOP SCHEDULING PROBLEM WITH AVAILABILITY CONSTRAINTS |
| M. Muller-Hannemann; K. Weihe |
A FIXED-PARAMETER ANALYSIS OF A PRODUCTION PLANNING PROBLEM |
| J. Niño-Mora |
AN INDEX POLICY FOR HARVESTING MULTIPLE RENEWABLE RESOURCES |
| N. V. Shakhlevich; V. A. Strusevich |
ON TWO BICRITERIA SCHEDULING PROBLEMS WITH CONTROLLABLE PROCESSING TIMES |
| A. Swiecicka; F. Seredynski |
MULTIPROCESSOR SCHEDULING AND RESCHEDULING WITH USE OF CELLULAR AUTOMATA |
| F. Tercinet; E. Neron; C. Lente; J. Carlier |
SATISFIABILITY TESTS FOR THE M-MACHINE PROBLEM |
| V. T'Kindt; F. Della Croce; C. Esswein |
REVISITING BRANCH AND BOUND SEARCH STRATEGIES FOR MACHINE SCHEDULING PROBLEMS |
| A. Toniolo Staggemeier; A. R. Clark; J. Smith |
GENETIC ALGORITHM + LINEAR PROGRAMMING TO SOLVE A LOT-SIZING AND SCHEDULING PROBLEM |
| T. J. Winterer |
FLIGHT SWAPPING WITH RETIMING |
