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 languageEnglish (US)
Pages (from-to)569-586
Number of pages18
JournalJournal of Scheduling
Volume17
Issue number6
DOIs
StatePublished - Oct 21 2014

Keywords

  • Correlation
  • Parallel machines
  • Processing time generation schemes
  • Scheduling

ASJC Scopus subject areas

  • Software
  • Engineering(all)
  • Management Science and Operations Research
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Processing time generation schemes for parallel machine scheduling problems with various correlation structures'. Together they form a unique fingerprint.

  • Cite this