This article addresses a multi-stage flowshop scheduling problem with equal number of unrelated parallel machines. The objective is to minimize the makespan for a given set of jobs in the system. This problem class is NP-hard in the strong sense, so a hybrid heuristic method for sequencing and then allocating operations of jobs to machines is developed. A number of test problems are randomly ge...

Abstract In many applications in the context of patient appointment scheduling there are recurring tasks with fixed delays between them. These commonly referred to as coupled-task jobs. settings, each job consists two whereby second task must start processing after an exact time lag following completion first task. this paper, we introduce problem a set jobs on parallel identical machines objec...