(A) heuristic approach to flow shop scheduling with bicriteria

Abstract

In the classical flow shop scheduling problem, the criterion mainly considered is makespan. But, for a flow shop scheduling problem where each job has its own due date, other types of criteria inherited by due dates, e.g., total tardiness, maximum lateness and number of tardy job, should be simultaneously considered. Up to the present, the research ans not been done sufficiently about the scheduling method considering the criterion of makespan as well as the other type of criterion referred above. Therefore, it is necessary to study the scheduling method for a flow shop which considers these criteria simultaneously. This study proposes a scheduling method for a flow shop using a value function with the criteria of makespan and total tardiness. To justify the proposed value function, simulations have been carried out and shows that the schedule generated by the proposed value function compromises between makespan and total tardiness by less tan or a little more than 10\% about best permutation schedule for each criteria. And the schedule generated by the value function can be modified through asking for the advice to whom has the domain specific knowledge.