A scheduling framework based on Petri net modeling and sequential Lagrangian relaxation approach
暂无分享,去创建一个
[1] J. Carlier,et al. An algorithm for solving the job-shop problem , 1989 .
[2] Marshall L. Fisher,et al. Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I , 1973, Oper. Res..
[3] Peter B. Luh,et al. An improved Lagrangian relaxation approach for solving job shop scheduling problems , 1992, [1992] Proceedings of the 31st IEEE Conference on Decision and Control.
[4] Stephen C. Graves,et al. A Review of Production Scheduling , 1981, Oper. Res..
[5] Krishna R. Pattipati,et al. A practical approach to job-shop scheduling problems , 1993, IEEE Trans. Robotics Autom..
[6] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .
[7] Boris Polyak. Minimization of unsmooth functionals , 1969 .
[8] M. Held,et al. A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.
[9] Jan Karel Lenstra,et al. Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..
[10] Tadao Murata,et al. Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.
[11] Jean-Marie Proth,et al. Performance evaluation of job-shop systems using timed event-graphs , 1989 .