@ARTICLE{Agárdi_Anita_The_2021,
 author={Agárdi, Anita and Nehéz, Károly},
 volume={vol. 12},
 number={No 3},
 journal={Management and Production Engineering Review},
 howpublished={online},
 year={2021},
 publisher={Production Engineering Committee of the Polish Academy of Sciences, Polish Association for Production Management},
 abstract={Unrelated Parallel Machines Scheduling Problem (U-PMSP) is a category of discrete optimization problems in which various manufacturing jobs are assigned to identical parallel machines at particular times. In this paper, a specific production scheduling task the U-PMSP with Machine and Job Dependent Setup Times, Availability Constraint, Time Windows and Maintenance Times is introduced. Machines with different capacity limits and maintenance times are available to perform the tasks. After that our problem, the U-PMSP with Machine and Job Dependent Setup Times, Availability Constraints, Time Windows and Maintenance Times is detailed. After that, the applied optimization algorithm and their operators are introduced. The proposed algorithm is the genetic algorithm (GA), and proposed operators are the order crossover, partially matched crossover, cycle crossover and the 2-opt as a mutation operator. Then we prove the efficiency of our algorithm with test results. We also prove the efficiency of the algorithm on our own data set and benchmark data set. The authors conclude that this GA is effective for solving high complexity parallel machine problems.},
 title={The Unrelated Parallel Machines Scheduling Problem with Machine and Job Dependent Setup Times, Availability Constraints, Time Windows and Maintenance Times},
 URL={http://ochroma.man.poznan.pl/Content/120917/2_Agardi_corr.pdf},
 doi={10.24425/mper.2021.138527},
 keywords={production scheduling, parallel machines, setup times, time windows, genetic algorithm},
}