1 |
Baker, K.R. and Scudder, G.D., 'Sequencing with Earliness and Tardiness Penalties: A Review.' Operations Research, 38, pp. 22-36, 1990
|
2 |
Bertsekas, D.P., Linear Network Optimization, Algorithms and Codes. MIT Press, Cambridge, Mass. 1991
|
3 |
Martello, S., Soumis, F. and Toth, P., 'Exact and approximation algorithms for makespan minimization on unrelated parallel machines,' Discrete Applied Mathematics, 75, pp. 169-188, 1977
|
4 |
Kuhn, N.W., 'The Hungarian Method for the Assignment Problem.' Naval Research Logistics Quarterly, 2, pp. 83-97, 1955
|
5 |
Piersma, N. and Van Dijk, W., 'A local search heuristics for unrelated parallel machine scheduling with efficient neighborhood search,' Mathematical Computer Modelling, 24(9), pp. 11-19, 1996
|
6 |
Baker, K.R., Introduction to Sequencing and Scheduling, N.Y., John Wiley, 1974
|
7 |
Yu, L., Smith, H.M., Pfund, M., Carlyle, W.M., and Fowler, J.W., 'Scheduling of unrelated parallel machines: an application to PWB manufacturing,' IIE Transactions, 34, pp. 921- 931, 2002
|
8 |
Palekar, U.S., Rama, N. and Toaffe, K. 'Duality based relaxations for makespan minimization for unrelated parallel machines,' TIMS/ORSA Bulletin, 31(MC2.2), pp. 21, 1991
|
9 |
Kanet, J.J., 'Minimizing the Average Deviation of Job Completion Times about a Common Due Date.' Naval Research Logistics Quarterly, 28, pp. 643-651, 1981
|