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

Deepak Gupta, Renuka *, Harminder Singh

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.


Keywords


Open Shop Scheduling, Elapsed time, Equivalent job, Disjoint job block.

Full Text:

pdf


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2022 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter