Name
Abstract | ||
|---|---|---|
The paper presents a new model for uniform parallel machine scheduling problem with uncertainty and randomness simultaneously for processing times of jobs based on chance theory. The objective of the model is to minimize expected completion time. The constraint of the model is that uncertain random completion time of scheduling is less than or equal to expected completion time. The model is transformed to a crisp non-deterministic polynomial hard mathematical programming model based on chance theory. Firstly, simulation techniques of the objective function and the left chance constraint are proposed. Then, two heuristic methods to solve the crisp model are presented. Finally, they are integrated into two hybrid intelligent algorithms for searching the quasi-optimal schedule. Besides, the effectiveness of the model and its hybrid intelligent algorithms are verified by a numerical example generated randomly. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s00500-018-3304-9 | soft computing |
Keywords | Field | DocType |
Parallel machine scheduling, Uncertainty theory, Chance theory, Uncertain random programming, Hybrid intelligent algorithm | Mathematical optimization,Heuristic,Machine scheduling,Polynomial,Computer science,Scheduling (computing),Intelligent algorithms,Algorithm,Randomness,Uncertainty theory | Journal |
Volume | Issue | ISSN |
23.0 | 15.0 | 1433-7479 |
Citations | PageRank | References |
0 | 0.34 | 35 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Weimin Ma | 1 | 427 | 26.76 |
| Yang Liu | 2 | 0 | 0.34 |
| Xingfang Zhang | 3 | 30 | 5.21 |