Customer order scheduling in a permutation flow shop environment

Various recent scheduling literature has studied the so called customer order scheduling problem. In this class of scheduling problems, there are multiple customer orders, and each of them consists of several jobs. The order finishes and is ready to be shipped when the last job of the order finishes. In this paper, we consider the customer order scheduling problem in a permutation flow shop environment with m machines. There are n orders and each order has o jobs. The objective is to minimize the total completion time of the orders. We present multiple problem properties and a MINLP formulation of the problem. Furthermore, four heuristics which follow the Iterated Greedy Algorithm are developed. In a computational experiment, we evaluated the four heuristics on their practicability. They showed good results in short calculation time when compared with the MINLP solution from a solver. Afterwards, we compared the four heuristics with each other for different problem sizes. • First consideration of the problem F m → 0 | p r m u | ∑ C i . • Deduction of multiple problem properties. • Providing a MINLP formulation. • Presentation and evaluation of 4 novel Iterated Greedy Algorithms for the problem. • Suggestions for appropriate solution strategies for different problem sizes.