In this paper we propose a tabu search implementation to solve the unrelated parallel machines scheduling problem with sequenceand machinedependent setup times to minimize the schedule’s makespan. The problem is NP-hard and finding an optimal solution efficiently is unlikely. Therefore, heuristic techniques are more appropriate to find near-optimal solutions. The proposed tabu search algorithm...

A new hybrid flow shop scheduling problem with blocking is studied. The problem is characterized by multistage unrelated parallel machines and no intermediate buffer. Firstly, the math model of the hybrid scheduling problem is constructed. And then the computation method of production period is given. Due to there is no intermediate buffer, and there are unrelated parallel machines in multi-sta...

Parallel machines concept is a well-known and widely used system in the manufacturing facilities. Scheduling of these parallel machines has been a key activity in the successful product outcome. Though jobs are executed on schedules, in certain cases the completion time increases resulting in tardiness. This survey work identifies and compiles the optimization strategies and solution approaches...