Scheduling jobs with multitasking and asymmetric switching costs

摘要

are costs depending on job A and B respectively. With this special form of switching cost, we show that the makespan, the total completion time and the due date assignment problems can be formulated as linear assignment problems and thus be solved in polynomial time. Even if stress effect is introduced, these three scheduling problems with the special form of asymmetric switching costs are polynomial time solvable.