Advanced Scheduling Model For Unrelated Parallel Machines Problem With Job-Sequence Dependent Setup Times, Availability Constraints And Time Windows

Production scheduling is still an important method at manufacturing companies, providing accurate, real-time schedules and helps in decision support. This article examines a specific production planning problem, the Advanced Scheduling Model for Unrelated Parallel Machines Problem with Job-Sequence Dependent Setup Times, Availability Constraints and Time Windows. In this problem, many different types of products have to be manufactured. Each job has predefined average machining times and can have time windows, which mean that the task can only be performed at a certain time interval. There is also a setup time, which means the period required to prepare a machine to accept a new job or operation. Number of machines, availability constraints (indicates how long the machine can be used) are also known in advance and our goal is to minimize the setup time, considering all constraints. In this paper, we present the solution of the problem with Genetic Algorithm. We also present a permutation representation of the problem and the evaluation of the representation. Dataset and test results are also presented. Based on the test results Genetic Algorithm can be an effective algorithm to solve the Parallel Machines Problem.

@article{agardi2020advanced,
  title={ADVANCED SCHEDULING MODEL FOR UNRELATED PARALLEL MACHINES PROBLEM WITH JOB-SEQUENCE DEPENDENT SETUP TIMES, AVAILABILITY CONSTRAINTS AND TIME WINDOWS.},
  author={AG{'A}RDI, Anita and NEH{'E}Z, K{'a}roly},
  journal={Academic Journal of Manufacturing Engineering},
  volume={18},
  number={2},
  year={2020}
}