Multi-factory Job Shop Scheduling With Due Date Objective

The existing literature on distributed scheduling mainly focuses on the performance measures makespan, total completion time, or costs. Due date related objectives that are gaining in importance in the industry have not been considered to a similar extent. In this contribution, we present a model formulation of the distributed job shop scheduling problem with due date consideration and present adapted greedy heuristics as well as a genetic algorithm to solve large problem instances. Computational experiments are carried out to assess the performance of the model and the algorithms. The heuristics and metaheuristics show promising results in reasonable computation times, with the genetic algorithm outperforming the other heuristics. The results indicate that managers should consider incorporating due date related objectives in the decision-making process of production planning and scheduling in distributed manufacturing.