The value of processing flexibility in multipurpose machines

Examines the scheduling problem in a multipurpose machine environment where every job can be processed by a subset of machines operated in parallel. Development of lower bounds, heuristic algorithms and branch-and-bound procedure; Performance of computational experiment; Assessment of the flexibility to render multipurpose machine system.