Two Single Machine Sequencing Problems Involving Controllable Job Processing Times

References

• Baker , K. R. , Introduction to Sequencing and Scheduling , John Wiley & Sons , New York , N.Y. ( 1974 ) .
   Google Scholar
• Baker , K. R. , and Schrage L. , “ Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks ,” Opns. Res. , 26 , 111 – 120 ( 1978 ).
   Google Scholar
• Conway , R. W. , Maxwell W. L. , and Miller L. W. , Theory of Scheduling , Addison-Wesley , Reading , Mass ( 1967 ) .
   Google Scholar
• Garfinkel , R. S. , and Nemhauser G. L. , Integer Programming , John Wiley & Sons , New York , N.Y. ( 1972 ) .
   Google Scholar
• Hillier , F. S. , and Lieberman G. J. , Operations Research, , 1st ed. , Holden-Day , San Francisco ( 1967 ) .
   Google Scholar
• Jackson , J. R. , “ Scheduling a Production Line to Minimize Maximum Tardiness ,” Research Report 43, Management Sciences Research Project , UCLA ( 1955 ) .
   Google Scholar
• Lenstra , J. K. , A.H.G. Rinnooy Kan, and Brucker P. , “ Complexity of Machine Scheduling Problems ,” Ann. Discrete Math. 1 , 343 – 362 ( 1977 ).
   Google Scholar
• Lawler , E. L. , Combinatorial Optimization: Networks and Matroids , Holt, Rinehart and Winston , New York ( 1976 ) .
   Google Scholar
• Lawler , E. L. and Moore J. M. , “ A Functional Equation and Its Application to Resource Scheduling and Sequencing Problems ,” Mgt. Sci , 16 , 77 – 84 ( 1969 ).
   Web of Science ®Google Scholar
• Rinnooy Kan , A. H. G. , Lageweg B. J. , and. Lenstra J. K. , “ Minimizing Total Costs in One-Machine Scheduling ,” Opns. Res. , 23 , 908 – 927 ( 1975 ).
   Web of Science ®Google Scholar
• Smith , W. E. , “ Various Optimizers for Single-Stage Production ,” Naval Res. Logist. Quart. , 3 , 59 – 66 ( 1956 ).
   Google Scholar
• Veinott , A. F. , Jr. , “ Production Planning with Convex Costs: a Parametric Study ,” Mgt. Set , 10 , 441 – 460 ( 1964 ).
   Web of Science ®Google Scholar
• Vickson , R. G. , “ Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine ,” Opns. Res. (forthcoming).
   Google Scholar