set of penalties, negative and positive values show earliness and tardiness, respectively
optimality criterion which is a function of earliness and tardiness
116
List o f Notations 117
value of the optimality criterion for the schedule of a
optimal value of the optimality criterion for the schedule of a
class of problems for which a polynomial-bounded algorithm exists class of problems solvable by backtrack search of polynomial-bounded depth
idle time to be inserted before job Jj
List o f Notations 118
minimum attainable value of the penalty function for the partial schedule of crj U { Jj } when job Jj £ J \ Ja·. is scheduled at
List o f Notations 119
number of problems in which optimal solution found among generated random problems by a heuristic procedure
{Ji € T,'}
References
1. Azizoğlu, M., S. Kondakçı and Ö. Kırca (1991), “Bicriteria Scheduling Problem Involving Total Tardiness and Total Earliness Penalties” , Interna
tional J. Production Economics^ 23, 17-24.
2. Bagchi, U., R.S. Sullivan and Y-L. Chang (1986), “Minimizing Mean Absolute Deviation of Completion Times About a Common Due Date” , Naval Research Logistics Quarterly^ 33, 227-240.
3. Bagchi, U., Y-L. Chang and R.S. Sullivan (1987), “Minimizing Absolute and Squared Deviations of Completion Times with Different Earliness and Tardiness Penalties and a Common Due Date” , Naval Research Logistics
Quarterly, 34, 739-751.
4. Bagchi, U., R.S. Sullivan and Y-L. Chang (1987), “Minimizing Mean Squared Deviation of Completion Times About a Common Due Date” , Management Science, 33, 894-906.
5. Baker, K.S. (1974), Introduction to Sequencing and Scheduling, .John Wiley, New York.
6. Baker, K.S. (1984), “Sequencing Rules and Due-Date Assignments in a Job Shop” , Management Science, 30, 1093-1104.
120
References 121
7. Baker, K.S. and G.D. Scudder (1990), “Sequencing with Earliness and Tardiness Penalties: A Review” , Operations Research^ 38, 22-36.
8. Bector, C.R., Y.P. Gupta and M.C. Gupta (1988), “ Determination of an Optimal Common Due Date and Optimal Sequence in a Single Machine Job Shop” , International J. Production Research, 26, 613-628.
9. Bellman, R.E. (1957), Dynamic Programming, Princeton University Press, Princeton.
10. Chambers, R.J., R.L. Carraway, T.J. Lowe and T.L. Morin (1991)
“Dominance and Decomposition Heuristics for Single Machine Sequencing” , Operations Research, 39, 639-647.
11. Cheng, T.C.E. (1984), “ Optimal Due-Date Determination and Sequencing of n Jobs on a Single Machine” , J. Operational Research Society, 35, 433- 437.
12. Cheng, T.C.E. (1987), “An Algorithm for the CON Due-Date Determina
tion and Sequencing Problem” , Computers and Operations Research, 14, 537-542.
13. Cheng, T.C.E. (1988a), “An Alternative Proof of Optimality for the Com
mon Due-Date Assignment Problem” , European J. Operational Research, 37, 250-253.
14. Cheng, T.C.E. (1988b), “Optimal Common Due-Date with Limited Completion Time Deviation” , Computers and Operations Research, 15, 91- 96.
15. Cheng, T.C.E. (1990a), “A Note on a Partial Search Algorithm for the Single-Machine Optimal Common Due-Date Assignment and Sequencing Problem” , Computers and Operations Research, 17, 321-324.
References 122
16. Cheng, T.C.E. (1990b), “Dynamic Programming Approach to the Single- Machine Sequencing Problem with Different Due-Dates” , Computers and Mathematical Applications, 19, 1-7.
17. Cheng, T.C.E. and. M.C. Gupta (1989), “Survey of Scheduling Research Involving Due Date Determination Decisions” , European J. Operational Research, 38, 156-166.
18. Conway, R.W ., W.L. Maxwell, and L.W. Miller (1967), Theory o f Scheduling, Addison-Wesley, Reading, Mass.
19. Davis, J.S. and J.J. Kanet (1992), “Single-Machine Scheduling with Early and Tardy Completion Costs” , Naval Research Logistics, to appear.
20. De, P., J.B. Ghosh and C.E. Wells (1989), “A Note on the Minimization of Mean Squared Deviation of Completion Times About a Common Due Date” , Management Science, 35, 1143-1147.
21. Emmons, H. (1969), “One-Machine Sequencing to Minimize Certain Functions of Job Tardiness” , Operations Research, 17, 701-715.
22. Emmons, H. (1987), “Scheduling to a Common Due Date on Parallel Uniform Processors” , Naval Research Logistics, 34, 803-810.
23. Erlenkotter, D. (1975), “Capacity Planning for Large Multilocation Sys
tems: Approximate and Incomplete Dynamic Programming Approaches” , Management Science, 22, 274-285.
24. Fisher, M.L. (1976), “A Dual Algorithm for the One-Machine Scheduling Problem” , Mathematical Programming, 11, 229-251.
25. Fry, T.D., R.D. Armstrong and J.H. Blackstone (1987), “Minimizing Weighted Absolute Deviation in Single Machine Scheduling” , HE Trans
actions, 19, 445-450.
References 123
26. Fry, T.D., G.K. Leong and T.R. Rakes (1987), “Single Machine Scheduling:
A Comparison of Two Solution Procedures” , OMEGA, 15, 277-282.
27. Fry, T.D., R.D. Armstrong and L.D. Rosen (1990), “Single Machine Scheduling to Minimize Mean Absolute Lateness: A Heuristic Solution” ,
Computers and Operations Research, 17, 105-112.
28. Carey, M.R. and D.S. Johnson (1979) Computers and Intractability: A Guide to the Theory o f NP-Completeness, W.H. Freeman, New York.
29. Carey, M.R., R.E. Tarjan and C.T. Wilfong (1988), “ One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties” , Mathemat
ics o f Operations Research, 13, 330-348.
30. Hall, N.C. (1986), “Single- and Multiple-Processor Models for Minimizing Completion Time Variance” , Naval Research Logistics Quarterly, 33, 49-54.
31. Hall, N.C., W. Kubiak and S.P. Sethi (1991), “Earliness-Tardiness Schedul
ing Problems, ILDeviation of Completion Times About a Restrictive Common Due Date” , Operations Research, 39, 847-856.
32. Hall, N.C. and M.E. Posner (1991), “Earliness-Tardiness Scheduling Problems, LWeighted Deviation of Completion Times About a Common Due Date” , Operations Research, 39, 836-846.
33. Hoogeveen, J.A. (1992), Single-Machine Bicriteria Scheduling, Unpublished Ph.D. Thesis, CWI, Amsterdam.
34. Hoogeveen, J.A. and S.L. van de Velde (1992), “Scheduling Around a Small Common Due Date” , Report BS-R8914, Centre for Mathematics and Computer Science, Amsterdam.
35. Ibaraki, T. and Y. Nakamura (1990), “A Dynamic Programming Method for Single Machine Scheduling” , Technical Report 7^90004, Kyoto University, Kyoto, Japan.
References 124
36. Kanet, J.J. (1981), “Minimizing the Average Deviation of Job Completion Times About a Common Due Date” , Naval Research Logistics Quarterly, 28, 64.3-651.
37. Kim, Y-D. and C.A. Yano (1987), “Algorithms for Single Machine Scheduling Problems Minimizing Mean Tardiness and Earliness” , Technical Report 87-27, The University of Michigan, Ann Arbor, Michigan.
38. Lakshminarayan, S., R. Lakshmanan, R.L. Papineau and R. Rochette (1978), “ Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties” , Operations Research, 26, 1079-1082.
39. Lawler, E.L. (1977), “A Pseudopolynomial Algorithm for Sequencing Jobs to Minimize Total Tardiness” , Annals o f Discrete Mathematics, 1, 331-342.
40. Lawler, E.L., J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys (1989),
“Sequencing and Scheduling: Algorithms and Complexity” , Report BS- R8909, Centre for Mathematics and Computer Science, Amsterdam, The Netherlands.
41. Lawler, E.L. and J.M. Moore (1969), “A Functional Equation and its Ap
plication to Resource Allocation and Sequencing Problems” , Management Science, 16, 77-84.
42. Morin, T.L. (1979) “Computational Advances in Dynamic Programming” , Dynamic Programming and Its Applications, 53-90. Academic Press, New York.
43. Oğuz, C. and C. Dinçer (1992), “Single Machine Earliness-Tardiness Scheduling with Equal-Slack Rule” , Research Report No.IEOR9203, Department of Industrial Engineering, Bilkent University (submitted to the J. Operational Research Society).
44. Oğuz, C. T.L. Morin and C. Dinçer (1992), “Incomplete Dynamic Programming for Single Machine Scheduling with both Earliness and
References 125
Tardiness Penalties” , Research Report No.IEOR9210, Department of Industrial Engineering, Bilkent University.
45. Ow, P.S. and T.E. Morton (1988), “Filtered Beam Search in Scheduling” , International J. Production Research, 26, 35-62.
46. Ow, P.S. and T.E. Morton (1989), “The Single Machine Early/Tardy Problem” , Management Science, 35, 177-191.
47. Panwalkar, S.S., M.L. Smith and A. Seidmann (1982), “Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem” , Operations Research, 30, 391-399.
48. Potts, C.N. and L.N. Van Wassenhove (1982) “A Decomposition Algorithm for the Single Machine Total Tardiness Problem” , Operations Research Letters, 1, 177-181.
49. Quaddus, M. (1987), “A Generalized Model of Optimal Due-Date Assignment by Linear Programming” , J. Operational Research Society, 38, 353-359.
50. Raghavachari, M. (1986), “A V-Shape Property of Optimal Schedule of Jobs About a Common Due Date” , European J. Operational Research, 23, 401-402.
51. Rinnooy Kan, A.H.G. (1976), Machine Scheduling Problems, Martinus Nijhoff, The Hague, The Netherlands.
52. Seidmann, A., S.S. Panwalkar and M.L. Smith (1981), “Optimal As
signment of Due-Dates for a Single Processor Scheduling Problem” , International J. Production Research, 19, 393-399.
53. Sen, T. and S.K. Gupta (1984), “A State-of-Art Survey of Static Scheduling Research Involving Due Dates” , Omega, 12, 63-76.
References 126
54. Sidney, J.B. (1977), “Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties” , Operations Research^ 25, 62-69.
55. Sundararaghavan, P.S. and M.U. Ahmed (1984), “Minimizing the Sum of Absolute Lateness in Single-Machine and Multimachine Scheduling” , Naval Research Logistics Quarterly, 31, 325-333.
56. Szwarc, W. (1989), “Single-Machine Scheduling to Minimize Absolute Deviation of Completion Times from a Common Due date” , Naval Research Logistics, 36, 663-673.
57. Tahboub, Z-A. A-M. and W.E. Wilhelm (1987), “Use of a Surrogate Problem to Minimize Total Earliness-Tardiness Penalties on a Single- Machine” , Working Paper No 1986-010, Dept, of Industrial and Systems Engineering, The Ohio State University.
58. Yano, C.A. and Y-D. Kim (1989), “Algorithms for a Class of Single- Machine Weighted Tardiness and Earliness Problems” , Technical Report, The University of Michigan, Ann Arbor, Michigan.
Vita
Ceyda Oğuz was born in Elazığ, on 3 May 1964. She attended the Department of Industrial Engineering, Middle East Technical University in September 1982 and graduated with honors in July 1986. In September 1986, she joined to the Department of Industrial Engineering, Bilkent University as a research assistant.
From that time to the present, she worked with Dr. Cemal Dinçer for her graduate study at the same department. She got her M.S. degree in October 1988 with the thesis titled as “Design and Analysis o f Just-In-Time Production Systems”. During her Ph.D. study with Dr. Cemal Dinçer, she worked on the Single Machine Early-Tardy Scheduling Problems. Currently, she is a research assistant at the Department of Industrial Engineering, Bilkent University.
127