• A MATHEMATICAL APPROACH FOR TWO STAGE OPEN SHOP SCHEDULING WITH A STRING OF DISJOINT JOB BLOCKS

Abstract

In this paper we present an efficient heuristic technique to solve n jobs, 2 machine open shop Scheduling problem in which Processing times are associated with their respective probabilities along with the concept of disjoint job blocks in a String. The objective of the study is to obtain an optimal or near optimal String of jobs in order to minimize the makespan. The algorithm developed in this paper is straightforward and is illustrated by a numerical example.