Abstract
This research considers the generation of random processing times for parallel machine scheduling problems. We present several processing time generation schemes that consider different levels and combinations of machine correlation and job correlation. Also, metrics to evaluate the amounts of machine relatedness and job uniformity for the randomly generated processing times of a given problem instance are presented. The proposed schemes generate desirable problem instances that can be used to test different solution approaches (such as heuristics, dynamic programming, and branch-and-bound). Computational results indicate that the schemes provide problem instances with many desirable properties.
Original language | English (US) |
---|---|
Pages (from-to) | 569-586 |
Number of pages | 18 |
Journal | Journal of Scheduling |
Volume | 17 |
Issue number | 6 |
DOIs | |
State | Published - Oct 21 2014 |
Keywords
- Correlation
- Parallel machines
- Processing time generation schemes
- Scheduling
ASJC Scopus subject areas
- Software
- General Engineering
- Management Science and Operations Research
- Artificial Intelligence