On the solution region for certainscheduling problems with preemption Heidemarie BräselNatalia Shakhlevich OriginalPaper Pages: 1 - 22
Batch scheduling with deadlines on parallel machines Peter BruckerMikhail Y. KovalyovFrank Werner OriginalPaper Pages: 23 - 40
Jackson's Pseudo Preemptive Schedule for the Pm/r i , q i /C max scheduling problem J. CarlierE. Pinson OriginalPaper Pages: 41 - 58
Branch and bound algorithms for single-machinescheduling with batch set-up times to minimizetotal weighted completion time H.A.J. CrauwelsA.M.A. HaririL.N. Van Wassenhove OriginalPaper Pages: 59 - 76
On the boolean-quadric packinguncapacitated facility-location polytope Jill HardinJon LeeJanny Leung OriginalPaper Pages: 77 - 94
Genetic algorithm for the permutation flow-shopscheduling problem with linear models of operations Adam JaniakMarie-Claude Portmann OriginalPaper Pages: 95 - 114
Heuristic procedures for parallel-machine schedulingproblems with stochastic precedence constraints Klaus NeumannJürgen Zimmermann OriginalPaper Pages: 115 - 136
Parallel branch-and-bound methods for thejob-shop scheduling problem Michael PerregaardJens Clausen OriginalPaper Pages: 137 - 160
Nonstrict vector summationin multi-operation scheduling Sergey Sevastianov OriginalPaper Pages: 179 - 212
On the calculation of the stability radiusof an optimal or an approximate schedule Yuri N. SotskovAlbert P.M. WagelmansFrank Werner OriginalPaper Pages: 213 - 252
