摘要
对于部分机器需要周期维护,其余机器在所考虑的时间范围内一直可用的混合型平行机调度问题,分别采用基于机器拆分的建模思想和基于机器拼接的建模思想构建该调度问题的数学规划模型。
Mathematical programming models are established by adopting the idea of machine splitting and the idea of machine splicing respectively for a hybrid parallel machine scheduling problem where some machines need periodic maintenance while the rest ones are always available in the time range under consideration.
引文
[1]Xu D,Qu M.Makespan minimization for two parallel machines scheduling with a periodic availability constraint:The preemptive offline version[C]The Third International Joint Conference on Computational Sciences and Optimization,vol.2.2010,177-181.
[2]Xu D,Cheng Z,Yin Y,et al.Makespan minimization for two parallel machines scheduling with a periodic availability constraint[J].Computers&Operations Research,2009,36:1809-1812.
[3]Xu D,Yang D-L.Makespan minimization for two parallel machines scheduling with a periodic availability constraint:Mathematical programming model,average-case analysis,and anomalies[J].Applied Mathematical Modelling,2013,37:7561-7567.
[4]何杰.预防性维护下的混合型平行机调度问题研究[D].湖南大学,2016.
[5]Liu M,Zheng F,Chu C,et al.Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint[J].Theoretical Computer Science,2011,412:5225-5231.
[6]张家宝.考虑维护和可中断工件的混合型平行机调度问题研究[J].江西科学,2015,5:647-651,707.
[7]徐德华.车间运行与维护的集成调度理论[M].武汉:武汉大学出版社,2015.