The permutation flow shop scheduling problems with deteriorating jobs and rejection on dominant machines were studied.The objectives are to minimize the makespan of scheduled jobs plus the total rejection penalty and the total completion time of scheduled jobs plus the total rejection penalty.For each objective, polynomial time algorithms based on dynamic programming were presented.
展开▼
