References
- ALON, N., AZAR, Y., WOEGINGER, G. J. and YADID, T., 1998, Approximation algorithms for scheduling on parallel machines. Journal of Scheduling, 1, 55–66.
- CENTENO-RODRIGUEZ, G., 1998, Parallel machine scheduling with specified release dates, due dates, and machine eligibility restrictions for minimizing makespan and lateness. Doctoral dissertation, University of Central Florida.
- CHEN, B. and VESTJENS, A. P. A., 1997, Scheduling on identical machines: how good is LPT in an on-line setting? Operations Research Letters, 21, 165–169.
- CHENG, T. C. E. and SIN, C. C. S., 1990, A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research, 47, 271–292.
- HALL, L. A., SCHULZ, A. S., SHMOYS, D. B. and WEIN, J., 1997, Scheduling to minimize average completion time: off-line and on-line approximation algorithms. Mathematics of Operations Research. 22, 513–542.
- LAWLER, E. L., LENSTRA. J. K., RINNOOY KAN, A. H. G. and SHMOYS, D. B., 1993, Sequencing and scheduling: algorithms and complexity. In Handbook in Operations Research and Management Science (Amsterdam: North Holland), vol. 4, pp. 445–522.
- MACCARTHY, B. L. and LIU, J., 1993, Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling. International Journal of Production Research, 31, 59–79.
- PINEDO, M., 1995, Scheduling Theory, Algorithms, and Systems (Englewood Cliffs: Prentice Hall).
- SGALL. J., 1998, On-line scheduling - a survey. In Fiat, A. and Woeginger. G. J. (eds.). On-Line Algorithms: The State of the Art. Lecture Notes in Computer Science. vol. 1442 (Berlin: Springer-Verlag).
- UZSOY. R., LEE. C. Y. and MARTIN-VEGA. L. A 1992. Scheduling semiconductor test operations: minimizing maximum lateness and number of tardy jobs on a single machine. Naval Research Logistics. 39. 369–388.