MINIMIZING THE TOTAL COMPLETION TIME FOR HYPOTHETICAL CASES IN OPEN SHOP SCHEDULING PROBLEM

Journal: International Journal of Advanced Research in Engineering and Technology (IJARET) (Vol.11, No. 11)

Publication Date: 2020-11-30

Authors : M. Sophia S. Jayakumar M. Lakshmi;

Page : 1420-1425

Keywords : Open shop scheduling problem; Heuristics; Total Completion Time.;

Source : Download Find it from : Google Scholar

Abstract

In this paper the researchers have been focusing on the open shop scheduling problems with the objective of minimising the total completion time. Jayakumar (2001)solved the problem with the objective of minimising the makes pan and the present work is the extension of the previous work for the n-Job m-Machine hypothetical case that of some job does not require some machine for processing.

Main Menu

Searching By

PARTNERS

MINIMIZING THE TOTAL COMPLETION TIME FOR HYPOTHETICAL CASES IN OPEN SHOP SCHEDULING PROBLEM

Abstract

Advertisement