For the job shop scheduling problem with processing time variability,a conservative and robust Minimax analysis method was proposed to estimate the worst scenario and its corresponding bound of scheduling performance indicator.A Minimax model was formulated based on the earli E/T penalty cost of each job.To solve the huge search space problem of traditional traversal or enumeration methods,a convex function theorem was proposed and proved,which can constrict and filter the processing time ranges effectively...
| 
推荐 
点击下列相关研究机构和相关文献作者，可以直接查到这些机构和作者被《中国知识资源总库》收录的其它文献，使您全面了解该机构和该作者的研究动态和历史。
