The Practice and Prospect of Inverse Scheduling Based on Inverse Optimization Theory
Mou Jianhui, Mu Jiancai, Yin Lvjiang, Chen Gang
摘要(Abstract)：
The goal of scheduling in traditional manufacturing system is to arrange the operations on corresponding machines with optimal sequence for one or multiple objectives. However, in an actual production system, schedule system often encounters many uncertain events. However, real manufacturing systems often encounter many uncertain events. These will change the status of manufacturing systems. These may cause the original schedule to no longer be optimal or even to be infeasible. Traditional scheduling methods, however, can’t cope with these cases. New scheduling methods are needed. Among these new methods, one method “inverse scheduling problem” (ISP) has attracted more and more attentions. In this paper, we pay attention to the inverse optimization problem (IOP) and try to find some ways to solve the ISP. In view of this, this paper provides a comprehensive review of both stateoftheart approaches on IOP and ISP. Firstly, we focus on the classification of ISP. Secondly, an analysis of the current literature about IOP is presented. And then, the relative relationship between ISP and IOP is discussed. Finally, based on the analysis of the limitations of current research, some future research directions of ISP are provided.
关键词(KeyWords)： inverse optimization, inverse scheduling, information technology, combinational optimization
基金项目(Foundation): This research work was supported by the National Science Foundation of China (NSFC) under Grant No. 51605267; the Natural Science Foundation of Shandong Province, China, under Grant No. ZR2016EEQ07; Colleges and universities of Shandong province science and technology plan projects under Grant No. J16LB04.
作者(Author): Mou Jianhui, Mu Jiancai, Yin Lvjiang, Chen Gang
Email:
参考文献(References)：
 A. Chakib, M. Johri, A. Nachaoui, M. Nachaoui. On a numerical approximation of a highly nonlinear parabolic inverse problem in hydrology. Physical Review C. (2015).
 A. Deaconu and E. Ciurea. Inverse feasibility problems of the inverse maximum flow problems. Sadhana. 38(2), 199209 (2013).
 A. Farago and A. Szentesi, B. Szviatovski. Inverse optimization in highspeed networks. Discrete Applied Mathematics. 129, 8398 (2003).
 A. Kasperski and A. Kurpisz, P. Zielinski. Approximating a twomachine flow shop scheduling under discrete scenario uncertainty. European Journal of Operational Research. 217, 3643 (2012).
 A. Kasperski and P. Zieliński. Approximating Combinatorial Optimization Problems with Uncertain Costs and the OWA Criterion. Operations Research Letters. 41(6), 639643 (2013).
 B. P. T. Sokkalingam. The minimum cost flow problem: primal algorithms and cost perturbations. (2010).
 C. Artigues and M. J. Huguet, F. Gueye, F. Schettini, L. Dezou. Statebased accelerations and bidirectional search for biobjective multimodal shortest paths. Transportation Research Part C Emerging Technologies. 27(2), 233259 (2013).
 C. Heuberger. Inverse combinatorial optimization, a survey on problems, methods, and results. J. Comb. Optim.8, 329361 (2004).
 C. Koulamas. Inverse scheduling with controllable job parameters. International Journal of Services and Operations Management. 1, 3543 (2005).
 D. Burton, Ph. L. Toint. On an instance of the inverse shortest path problem. Mathematical Programming. 53, 4561(1992).
 D. L. Yang and C. J. Lai, S. J. Yang. Scheduling problems with multiple due windows assignment and controllable processing times on a single machine. International Journal of Production Economics, 150, 96103 (2014).
 E. Nowicki and S. Zdrzalka. A survey of results for sequencing problems with controllable processing times, Discrete Applied Mathematics. 26, 271287 (1990).
 J. Lassig, A. Awasthi and O. Kramer. Common DueDate Problem: Linear Algorithm for a Given Job Sequence. IEEE, International Conference on Computational Science and Engineering, 97104 (2014).
 J. Li, J. Zhu. The Capacity Expansion Path Problem in Networks. Journal of Applied Mathematics. 2013,361376 (2013).
 J. Mou and X. Li, L Gao, L. Chao, Guohui Zhang. An Improved Genetic Algorithm for SingleMachine Inverse Scheduling Problem. Mathematical Problems in Engineering. 2014(4), 114 (2014).
 K. T. Nguyen, A. Chassein. Inverse eccentric vertex problem on networks. Central European Journal of Operations Research. 23(3), 687698 (2014).
 K. W. Steininger and B. BednarFriedl, H. Formayer, M. K?nig. Consistent economic crosssectoral climate change impact scenario analysis: method and application to austria. Climate Services, 1, 3952 (2016).
 L. Liu and E. Yao. Capacity inverse minimum cost flow problems under the weighted Hamming distance. Optimization Letters.112 (2015).
 L. Liu and Y. Chen, B. Wu, E Yao. Weighted Inverse Minimum Cut Problem under the SumType Hamming Distance// Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Springer Berlin Heidelberg. 2635 (2012).
 M. Cullen, M. A. Freitag, S.Kindermann, R. Scheichl. Large Scale Inverse Problems. (2013).
 M. Mohaghegh and F. B. Bonab. Inverse minmax spanning rarborescence problem under the weighted sumtype Hamming distance. AsianEuropean Journal of Mathematics (2016).
 M. Shirazi and H. Z. Aashtiani. Solving the minimum toll revenue problem in real transportation networks. Optimization Letters. 9(6), 11871197 (2015).
 M. Trick. Scheduling Multiple VariableSpeed Machines. Operations Research. 42, 234248 (1994).
 N. Martín, R. Mata. An efficient asymptotic approach for testing monotone proportions assuming an underlying logit based order doseresponse model. Statistics. 66(6), 654659 (2014).
 P. Brucker and N. V. Shakhlevich, V. Natalia. Inverse scheduling: twomachine flowshop problem . J Sched. 14,239256 (2011).
 P. Brucker and N. V. Shakhlevich. Inverse scheduling with maximum lateness objective. Journal of Scheduling. 12,475488 (2009).
 Pham. Hongtruong and X.W. Lu. Inverse problem of total weighted completion time objective with unit processing time on identical parallel machines. Journal of East China University of Science and Technology. 38(6), 757761 (2012).
 R. D. Guerra and D. A. L. D. Pablo, C. G. Martín. An approach to solve the nonproportionate flow shop with controllable processing times. South Asia Journal of South Asian Studies. 36(2),308309 (2013).
 R. G. Vickson. Choosing the job sequence and processing times to minimize total processing plus flow cost on single machine, Operations Research. 28, 11551167 (1980).
 R. J. Chen and F. Chen, T. G. Chun. Inverse problems of a single machine scheduling to minimize the total completion time. J .Shanghai Second Polytechnic University. 22(2), 17 (2005).
 R. K. Ahuja and J. B. Orlin. Inverse optimization. Operations Research. 49, 771783 (2001).
 R. P. W. vStancliffe and G. J. Duncan, C. R. Phair, G. T. Stabb. In situ gravity drainage system and method for extracting bitumen from alternative pay regions. (2016).
 R.J. Chen. Inverse Scheduling Problem on a Single Machine Stochastic Scheduling to Minimize the Total Completion Time. Journal of Changzhou Institute of Technology. 19(6), 15 (2006).
 S. Chand and D. Chhajed. A Single Machine Model for Determination of Optimal Due Dates and Sequence, Operations Research. 40, 596602 (1992).
 S. S. Li and P. Brucker, C.T. Ng, T. C. E. Cheng, N. V. Shakhlevich, J. J. Yuan. A note on reverse scheduling with maximum lateness objective. J Sched, 16,417422 (2013).
 Stout B ' Q. Optimal algorithms for unimodal regression, Computing 2%, the node assignment approach is capable of performing// Science and Statistics. (2014).
 V. Kayvanfar and I. Mahdavi, G. M. Komaki. Single machine scheduling with controllable processing times to minimize total tardiness and earliness. Computers & Industrial Engineering, 65, 166175 (2013).
 W. S. Chi and K. W. Shum, L. Huang, H. Y. Kwan. Linear network coding for erasure broadcast channel with feedback: complexity and algorithms. IEEE Transactions on Information Theory. 62(5), 24932503 (2016).
 W. X. Li and C. L. Zhao. Single machine scheduling problem with multiple due windows assignment in a group technology. Journal of Applied Mathematics & Computing. 48(12), 477494 (2015).
 X. Guan and P. M. Pardalos, X. Zuo. Inverse max plus sum spanning tree problem by modifying the sumcost vector under weighted l(infinity)norm. Journal of Global Optimization. 61(1), 165182 (2015).
 X. Guan, P. M. Pardalos, X. Zuo. Inverse Max plus Sum spanning tree problem by modifying the sumcost vector under weighted l(infinity)Norm. Journal of Global Optimization. 61(1), 165182 (2015).
 X. Suo. Tibshirani R. An Ordered Lasso and Sparse Timelagged Regression. Eprint Arxiv, (2014).
 Y. Chao. A Class of Network Bottleneck Capacity Expansion Problem with Constraints. A Class of Network Bottleneck Capacity Expansion Problem with Constraints. 2014.
 Y. Zhang, and P. Liu, L. Yang, Y. Gao. A biobjective model for uncertain multimodal shortest path problems. Journal of Uncertainty Analysis & Applications. 3(1), 117 (2015).
文章评论(Comment)：


