Scheduling of a Job Shop with Two Machine Centers Having Parallel Machines
45 Pages Posted: 1 Sep 2010
Date Written: August 28, 2010
Abstract
A job-shop with two machine centers with the second one consisting of k parallel machines is considered. An approximate algorithm for minimizing schedule length in the job shop with unit time operations in the first machine center and k time-units operations in the second is proposed. The algorithm has the absolute worst case error bound of k-1. Thus, the algorithm is optimal for k=1. Moreover, the algorithm can be modified to give optimal schedules for k=2. The paper extends considerably the earlier works on two machine job shops with unit time operations.
Keywords: scheduling, job shop, two machine centers, parallel machines
JEL Classification: C61
Suggested Citation: Suggested Citation