Current trends in deterministic scheduling Chung-Yee LeeLei LeiMichael Pinedo OriginalPaper Pages: 1 - 41
Preemptive multiprocessor task scheduling with release times and time windows L. BiancoJ. BlazewiczM. Drozdowski OriginalPaper Pages: 43 - 55
Complexity of scheduling problems with multi-purpose machines Peter BruckerBernd JurischAndreas Krämer OriginalPaper Pages: 57 - 73
Single machine scheduling with batch set-up times to minimize maximum lateness A.M.A. HaririC.N. Potts OriginalPaper Pages: 75 - 92
Rescheduling on a single machine with part-type dependent setup times and deadlines Ali Tamer UnalReha UzsoyAli S. Kiran OriginalPaper Pages: 93 - 113
Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates Suresh ChandRodney TraubReha Uzsoy OriginalPaper Pages: 115 - 125
Single machine hierarchical scheduling with customer orders and multiple job classes Jatinder N.D. GuptaJohnny C. HoJack A.A. van der Veen OriginalPaper Pages: 127 - 143
A single machine scheduling problem with common due window and controllable processing times Surya D. LimanShrikant S. PanwalkarSansern Thongmee OriginalPaper Pages: 145 - 154
Job shop scheduling with separable sequence-dependent setups In-Chan ChoiOsman Korkmaz OriginalPaper Pages: 155 - 170
Scheduling permutation flow shops using the Lagrangian relaxation technique Guandong LiuPeter B. LuhRichard Resch OriginalPaper Pages: 171 - 189
Stochastic scheduling of a batch processing machine with incompatible job families Izak DuenyasJohn J. Neale OriginalPaper Pages: 191 - 220
Multi-objective stochastic scheduling of job ready times Paul M. StanfieldRussell E. KingThom J. Hodgson OriginalPaper Pages: 221 - 239
Sequencing jobs with random processing times to minimize weighted completion time variance X. CaiS. Zhou OriginalPaper Pages: 241 - 260
Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time H.A.J. CrauwelsC.N. PottsL.N. Van Wassenhove OriginalPaper Pages: 261 - 279
An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search Stéphane Dauzère-PérèsJan Paulli OriginalPaper Pages: 281 - 306
Problem space search algorithms for resource-constrained project scheduling Kedar S. NaphadeS. David WuRobert H. Storer OriginalPaper Pages: 307 - 326
Applying constraint satisfaction techniques to job shop scheduling Cheng-Chung ChengStephen F. Smith OriginalPaper Pages: 327 - 357
On the design and development of object-oriented scheduling systems Michael PinedoBenjamin P.-C. Yen OriginalPaper Pages: 359 - 378
Using beam search techniques for sequencing mixed-model assembly lines Yow-yuh LeuPhilip Y. HuangRoberta S. Russell OriginalPaper Pages: 379 - 397
Preemptive scheduling with finite capacity input buffers Nicholas G. HallMarc E. PosnerChris N. Potts OriginalPaper Pages: 399 - 413
An analysis of heuristics for the parallel-machine flexible-resource scheduling problem Richard L. DanielsBarbara J. HoopesJoseph B. Mazzola OriginalPaper Pages: 439 - 472
Sizing and scheduling a full-time and part-time workforce with off-day and off-weekend constraints Hamilton EmmonsDu-Shean Fuh OriginalPaper Pages: 473 - 492