Scheduling of a Job Shop with Two Machine Centers Having Parallel Machines

45 Pages Posted: 1 Sep 2010

See all articles by Wieslaw Kubiak

Wieslaw Kubiak

University of Toronto

Suresh Sethi

University of Texas at Dallas - Naveen Jindal School of Management

Chelliah Sriskandarajah

Texas A&M University

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

Kubiak, Wieslaw and Sethi, Suresh and Sriskandarajah, Chelliah, Scheduling of a Job Shop with Two Machine Centers Having Parallel Machines (August 28, 2010). Available at SSRN: https://ssrn.com/abstract=1668633 or http://dx.doi.org/10.2139/ssrn.1668633

Wieslaw Kubiak

University of Toronto ( email )

105 St George Street
Toronto, Ontario M5S 3G8
Canada

Suresh Sethi (Contact Author)

University of Texas at Dallas - Naveen Jindal School of Management ( email )

800 W. Campbell Road, SM30
Richardson, TX 75080-3021
United States

Chelliah Sriskandarajah

Texas A&M University ( email )

Langford Building A
798 Ross St.
77843-3137

Do you have negative results from your research you’d like to share?

Paper statistics

Downloads
103
Abstract Views
709
Rank
469,563
PlumX Metrics