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.
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10951-013-0347-8/MediaObjects/10951_2013_347_Fig1_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10951-013-0347-8/MediaObjects/10951_2013_347_Fig2_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10951-013-0347-8/MediaObjects/10951_2013_347_Fig3_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10951-013-0347-8/MediaObjects/10951_2013_347_Fig4_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10951-013-0347-8/MediaObjects/10951_2013_347_Fig5_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10951-013-0347-8/MediaObjects/10951_2013_347_Fig6_HTML.gif)
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Banks, J., Carson II, J. S., Nelson, B. L., & Nicol, D. M. 2009. Discrete-event system simulation (5th ed.). Upper Saddle River, NJ: Prentice Hall.
Gordon, G. (1975). The application of GPSSV to discrete system simulation. Upper Saddle River, NJ: Prentice Hall.
Hall, N. G., & Posner, M. E. (2001). Generating experimental data for computational testing with machine scheduling applications. Operations Research, 49, 854–865.
Hariri, A. M. A., & Potts, C. N. (1991). Heuristics for scheduling unrelated parallel machines. Computers and Operations Research, 18, 323–331.
Panwalkar, S. S., Dudek, R. A., & Smith, M. L. (1973). Sequencing research and the industrial scheduling problem. In S. E. Elmaghraby (Ed.), Proceedings of Symposium on Theory of Scheduling and its Applications (pp. 29–38). New York: Springer.
Pinedo, M. (2012). Scheduling theory, algorithms, and systems (4th ed.). Upper Saddle River, NJ: Prentice Hall.
Vredeveld, T., & Hurkens, C. (2002). Experimental comparison of approximation algorithms for scheduling unrelated parallel machines. INFORMS Journal on Computing Linthicum, 14, 175–190.
Author information
Authors and Affiliations
Corresponding author
Appendix
Appendix
1.1 A derivation for generating start points \(x\)
Here we show the derivation of generating start points \(x\). In Fig. 7, the Cumulative Distribution Function (CDF) of processing time F(\(u)\) for \(u \in [b/q,b]\), given F(\(b\)/\(q)\) is
where, \(b\) is the maximum value of generating processing time (\(p_{ij}~\)= UNIF(1,\(b)\), and \(q = (3-S)/(1 + S)\), assume \(S~\)= \(\varGamma \),
From Fig. 7, the conditional probability of processing time \(p\in [b/q,u]\) given that \(x\in [1,b]\) is
Here, we define \(h_{x}(u)\) as a probability density function of processing time on the interval [\(x\), qx], support \(h_{x}(u)\in [x, qx]\) or \(h_{x}(u)\in [x,b]\).
For \(x\in [1,b/q], h_{x}(u)\) is uniform,
and for \(x\in [b/q,b], h_{x}(u)\) is uniform with changed support,
The probability of processing time \(p_{1 }\) given that \(x\in [b/q^{2},u/q]\) is
The probability of processing time \(p_{2 }\) given that \(x\in [u/q,b/q]\) is
and the probability of processing time \(p_{3 }\) given that \(x\in [b/q,u]\) is
We define \(g(x)\) is a probability density function of start point and assume \(g(x)\) is uniform,
In Fig. 7, \(F(u)\) is calculated as follows:
For \(\frac{b}{q}\le u\le b\),
for \(x\in [1,\frac{b}{q}]\), these are unrestricted intervals, so the density of points inside these intervals is uniform,
for \(x\in [b/q,b]\), we cut off the interval at \(b\), so the density of points inside that interval is higher than in the unrestricted intervals. We need to change the density of the start points that generate those intervals. From \(F(u)\), we know that the density of points inside those intervals will be uniform if
The density function of start point \(g(x)\) is:
\(c\) value ensures that \(\int \limits _{-\infty }^{\infty } g(x)\) dx = 1, so
Here, we write the CDF of \(g(x)\) as follows:
where,
Here, we check if \(G(x)\) between \(x\in [1,\frac{b}{q}]\) and \(x\in [\frac{b}{q},b]\) is continuous by plugging in \(x=\frac{b}{q}\) to
So, \(G(x)\) between \(x\in [1,\frac{b}{q}\)] and \(x\in [\frac{b}{q},b\)] is continuous. Plugging in \(c\) value and \(K\) value, we rewrite \(G(x)\) as follows:
Here, we use an inverse transform technique to generate the start point \(x\) from a random value \(R~\)= UNIF(0,1). Assume \(r = 1- q + b\) ln \(q\), and \(\kappa =1-\frac{b\ln b-b+1}{1-q+b\ln q}\)
For \(x\in [1,\frac{b}{q}\)]
and for \(x\in [\frac{b}{q},b\)]
Thus start point \(x\) is generated by
For \(0\le R < (q-1/r)(b/q-1)\), we generate the start point \(x\) from \(x = 1+ rR/(q-1)\), and for \((q-1/r)(b/q-1)\le R < 1\), we set \(x~\)= 100, and then use a do-loop to look for \(x\). We decrease \(x\) by setting \(x = x-1\) in each loop until we find an \(x\) that satisfies the equation \( rR - r\kappa -1\le b\) ln \(x-x\).
1.2 Pseudo-code for Cases 1–9
![figure a](http://media.springernature.com/lw685/springer-static/image/art%3A10.1007%2Fs10951-013-0347-8/MediaObjects/10951_2013_347_Figa_HTML.gif)
Rights and permissions
About this article
Cite this article
Lin, Y.K., Pfund, M.E. & Fowler, J.W. Processing time generation schemes for parallel machine scheduling problems with various correlation structures. J Sched 17, 569–586 (2014). https://doi.org/10.1007/s10951-013-0347-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-013-0347-8