A Hard Dial-a-Ride Problem that is Easy on Average Amin Coja-OghlanSven O. KrumkeTill Nierhoff OriginalPaper Pages: 197 - 210
New Single Machine and Job-Shop Scheduling Problems with Availability Constraints Ph. MauguièreJ.-C. BillautJ.-L. Bouquard OriginalPaper Pages: 211 - 231
Pre-Emptive Scheduling Problems with Controllable Processing Times Natalia V. ShakhlevichVitaly A. Strusevich OriginalPaper Pages: 233 - 253
Polynomial Algorithms for a Two-Class Multiprocessor Scheduling Problem in Mobile Telecommunications Systems Paolo DettiAlessandro AgnetisGianfranco Ciaschetti OriginalPaper Pages: 255 - 273