Single Station MILP Scheduling Models Using Continuous and Discrete Approach

This paper presents two mixed linear programming models (MILP) for single-station production scheduling. These models use the two classical forms of time representation, continuous and discrete. Both models solve the sequencing and assignment of tasks for the same set of non-identical parallel machines. The two MILP models are solved using Gurobi Optimizer for different problem configurations and their results are displayed in a table showing the value of the objective function and its runtimes.

Automated summary

This paper introduces two mixed linear programming models (MILP) for single-station production scheduling, which utilize continuous and discrete forms of time representation. Both models address the sequencing and assignment of tasks for non-identical parallel machines. The models are solved using Gurobi Optimizer and the results are presented in a table, displaying the objective function's value and runtimes.