论文信息 - Task Scheduling Problem: Using the Most Constrained Variable Algorithm to Maximize - 字舞流文

Task Scheduling Problem: Using the Most Constrained Variable Algorithm to Maximize

Eunjin Kim | Jeremy Straub | Calvin Bina | Jaeden Lovin

[1] Steven Minton,et al. Integrating Heuristics for Constraint Satisfaction Problems: A Case Study , 1993, AAAI.

[2] Andrew J. Davenport,et al. Cooperative Strategies for Solving the Bicriteria Sparse Multiple Knapsack Problem , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[3] Peter B. Luh,et al. Steel-making process scheduling using Lagrangian relaxation , 2002 .

[4] David A. Lifka,et al. The ANL/IBM SP Scheduling System , 1995, JSSPP.

[5] Fred W. Glover,et al. The general employee scheduling problem. An integration of MS and AI , 1986, Comput. Oper. Res..

[6] C. Pantelides,et al. A simple continuous-time process scheduling formulation and a novel solution algorithm , 1996 .

[7] M. Carter,et al. Surgical process scheduling: a structured review. , 1997, Journal of the Society for Health Systems.

[8] David Ronen,et al. Ship scheduling: The last decade , 1993 .