Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty
References (17)
Scheduling n jobs on one machine to minimize the maximum tardiness with minimum number tardy
Computers Opns Res.
(1983)Proper efficiency and the theory of vector maximization
J. Mathemat. Anal. Applic.
(1968)- et al.
Complexity of machine scheduling problems
Ann. Discrete Mathemal
(1977) Introduction to Sequencing and Scheduling
(1974)A review of production scheduling
Opns Res.
(1981)- et al.
A state-of-the-art survey of static scheduling research involving due dates
Omega
(1984) Machine Scheduling Problem: Classification Complexity and Computation
(1976)- et al.
A survey of scheduling rules
Opns Res.
(1977)
There are more references available in the full text version of this article.
Cited by (0)
- ∗
Dr Thuruthickara C. John holds a Bachelors in Mechanical Engineering from the University of Kerala and a Masters in Engineering Management from the Indian Institute of Technology, Madras, both in India. He was employed at the Bhilai Steel Plant of the Steel Authority of India (SAIL) before coming to the U.S. for higher studies. Dr John graduated from Purdue University in 1984 with a Ph.D. in industrial engineering. Shortly afterwards he joined the faculty of the Systems & Industrial Engineering Department at the University of Arizona. Currently he is with the Manufacturing Systems Engineering Department at AT&T Bell Laboratories.
Copyright © 1989 Published by Elsevier Ltd.