Job Shop Scheduling with Multi-shot ASP

The job shop scheduling problem consists of many jobs that must be processed by a set of machines. It is one of the most complicated combinatorial optimization problems [3]. However, in the literature, there are relatively few studies that focus on large-scale job shop scheduling. A rolling horizon approach has been proposed in [5]. It divides the problem into sub-problems (time windows) and solves each sub-problem using a shift bottleneck heuristic while minimizing the total weighted tardiness. A decomposition heuristic based on multi-bottleneck machines was proposed in [8], where each subproblem was solved by a genetic algorithm. In this study, we investigate another decomposition method, balancing the number of operations per time window.