Solving hard problems like the Travelling Salesman Problem (TSP) is a major challenge faced by analysts even though many techniques are available. The main goal of TSP is that a number of cities should be visited by a salesman and return to the starting city along a number of possible shortest...

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...