Journal
IOT AND DATA SCIENCE IN ENGINEERING MANAGEMENT
Volume 160, Issue -, Pages 364-368Publisher
SPRINGER INTERNATIONAL PUBLISHING AG
DOI: 10.1007/978-3-031-27915-7_64
Keywords
Scheduling; MILP; Single station; Continuous; Discrete
Ask authors/readers for more resources
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.
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available