期刊名称：International Journal of Advances in Engineering and Management
电子版ISSN：2395-5252
出版年度：2021
卷号：3
期号：10
页码：396-401
DOI：10.35629/5252-0310207210
语种：English
出版社：IJAEM JOURNAL
摘要：In this paper, we summarize some results about the inverse scheduling problem 1 1| | n j j j INV w C of the total weighted completion time problem on single machines 1 1|| n j j j w C and the inverse scheduling problem 1 | | n j j Pm INV C of the total completion time objective on parallel machines 1 || n j j Pm C in which the processing times 1 2 , ,..., T n p p p p are minimally adjusted, so that the given schedule is satisfying the necessary conditions and sufficient conditions for the scheduling problem 1 1|| n j j j w C and 1 || n j j j Pm w C and becomes optimal with respect to 1 2 , ,..., T n p p p p . We have obtained the mathematical programming formulations for this inverse scheduling problem with different norms and provided efficient solution algorithms.
