A String of Disjoint Job Blocks on Two Stage Open Shop Scheduling with Transportation Time

Abstract

This paper provides a heuristic algorithm for n jobs, 2-machine Open-shop scheduling problem in which Processing times are associated with their respective probabilities. The concepts of disjoint job block in a string and transportation time from one machine to another are also taken into consideration. The specific goal of the study is to obtain an optimal or near optimal String of jobs to minimize the makespan. The heuristic algorithm developed in this paper is very simple and easy to understand. A numerical illustration is provided to demonstrate the computational efficiency of proposed algorithm.

Keywords: Open Shop Scheduling, Equivalent job, Disjoint  job block, Transportation Time.