This paper considers the hybrid flow shop scheduling problem. Most real world scheduling problems are NP-hard in nature. The main purpose of this paper is to present a new approach to the objective version of the well known hybrid flow shop problem. The processing of each job on each machine is...