A multi-objective approach to resource allocation in single machine scheduling
暂无分享,去创建一个
[1] R. G. Vickson,et al. Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine , 1980, Oper. Res..
[2] Salah E. Elmaghraby,et al. Activity networks: Project planning and control by network models , 1977 .
[3] Adam Janiak,et al. Job-shop scheduling with resource-time models of operations , 1987 .
[4] William L. Maxwell,et al. Theory of scheduling , 1967 .
[5] K. R. Baker,et al. A bicriterion approach to time/cost trade-offs in sequencing , 1982 .
[6] Adam Janiak,et al. Time-optimal control in a single machine problem with resource constraints , 1986, Autom..
[7] Raymond G. Vickson,et al. Two Single Machine Sequencing Problems Involving Controllable Job Processing Times , 1980 .
[8] Jeffrey B. Sidney,et al. An Extension of Moore’s Due Date Algotithm , 1973 .
[9] Richard L. Daniels. Joint sequencing/resource-allocation scheduling with multiple performance measures , 1986 .
[10] Jan Karel Lenstra,et al. Sequencing by enumerative methods , 1977 .
[11] A. Janiak. Minimization of the maximum completion time and maximum tardiness in one-machine scheduling problems subject to precedence and resource constraints , 1988 .
[12] Rakesh K. Sarin,et al. Scheduling with multiple performance measures: the one-machine case , 1986 .
[13] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .