.png){kind=icon}
.png){kind=icon}
Return
A new model and algorithm for uncertain random parallel machine scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-018-3304-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Parallel machine scheduling
Uncertainty theory
Chance theory
Uncertain random programming
Hybrid intelligent algorithm
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W