Trading off between makespan and customer responsiveness in flow shop sequencing

There is a vast literature on the problem of how to sequence products in a blocking flow shop so as to minimise makespan. It is often the case, however, that problem instances have multiple optima, and that within the set of optimal (or near optimal) solutions, other characteristics of importance vary substantially. Thus, the solution found by an approach that solely minimises makespan may be inferior to alternate solutions that have comparable makespan but superior value with regard to other criteria. In this paper, we demonstrate this by considering makespan and customer responsiveness, the potential that a sequence has for modification so as to incorporate customer order changes after production has begun. We consider the relationship between these two metrics and present computational results to show how different approaches to making trade-offs between them can change the solution characteristics substantially.