Find out how to access previewonly content
Date:
10 Aug 2007
Preemption in single machine earliness/tardiness scheduling
 Kerem Bülbül,
 Philip Kaminsky,
 Candace Yano
 … show all 3 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
We consider a single machine earliness/tardiness scheduling problem with general weights, ready times and due dates. Our solution approach is based on a timeindexed preemptive relaxation of the problem. For the objective function of this relaxation, we characterize cost coefficients that are the best among those with a piecewise linear structure with two segments. From the solution to the relaxation with these best objective function coefficients, we generate feasible solutions for the original nonpreemptive problem. We report extensive computational results demonstrating the speed and effectiveness of this approach.
 Baker, K. R., Scudder, G. D. (1990) Sequencing with earliness and tardiness penalties: a review. Operations Research 38: pp. 2236
 Bülbül, K. (2002). Justintime scheduling with inventory holding costs. PhD thesis, University of California at Berkeley.
 Bülbül, K., Kaminsky, P., Yano, C. A. (2004) Flow shop scheduling with earliness, tardiness and intermediate inventory holding costs. Naval Research Logistics 51: pp. 407445 CrossRef
 Davis, J., Kanet, J. (1993) Singlemachine scheduling with early and tardy completion costs. Naval Research Logistics 40: pp. 85101 CrossRef
 Dyer, M., Wolsey, L. (1990) Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Applied Mathematics 26: pp. 255270 CrossRef
 Fry, T., Keong Leong, G. (1987) A bicriterion approach to minimizing inventory costs on a single machine when early shipments are forbidden. Computers and Operations Research 14: pp. 363368 CrossRef
 Fry, T., Armstrong, R., Blackstone, J. (1987) Minimizing weighted absolute deviation in single machine scheduling. IIE Transactions 19: pp. 445450 CrossRef
 Fry, T., Armstrong, R., Rosen, L. (1990) Single machine scheduling to minimize mean absolute lateness: a heuristic solution. Computers and Operations Research 17: pp. 105112 CrossRef
 Fry, T., Armstrong, R., DarbyDowman, K., Philipoom, P. (1996) A branch and bound procedure to minimize mean absolute lateness on a single processor. Computers and Operations Research 23: pp. 171182 CrossRef
 Garey, M., Tarjan, R., Wilfong, G. (1988) Oneprocessor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Research 13: pp. 330348
 Gelders, L., Kleindorfer, P. (1974) Coordinating aggregate and detailed scheduling decisions in the onemachine job shop, I: theory. Operations Research 22: pp. 4660
 Graham, R., Lawler, E., Lenstra, J., Rinnooy Kan, A. (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5: pp. 287326
 Hall, N., Posner, M. (2001) Generating experimental data for computational testing with machine scheduling applications. Operations Research 49: pp. 854865 CrossRef
 Hoogeveen, J., Velde, S. (1996) A branchandbound algorithm for singlemachine earlinesstardiness scheduling with idle time. INFORMS Journal on Computing 8: pp. 402412 CrossRef
 Kanet, J., Sridharan, V. (2000) Scheduling with inserted idle time: problem taxonomy and literature review. Operations Research 48: pp. 99110 CrossRef
 Kim, Y.D., Yano, C. A. (1994) Minimizing mean tardiness and earliness in singlemachine scheduling problems with unequal due dates. Naval Research Logistics 41: pp. 913933 CrossRef
 Lee, C., Choi, J. (1995) A genetic algorithm for job sequencing problems with distinct due dates and general earlytardy penalty weights. Computers and Operations Research 22: pp. 857869 CrossRef
 Lenstra, J., Rinnooy Kan, A., Brucker, P. (1977) Complexity of machine scheduling problems. Annals of Discrete Mathematics 1: pp. 343362 CrossRef
 Mazzini, R., Armentano, V. (2001) A heuristic for single machine scheduling with early and tardy costs. European Journal of Operational Research 128: pp. 129146 CrossRef
 McNaughton, R. (1959) Scheduling with deadlines and loss functions. Management Science 6: pp. 112
 Mosheiov, G. (1996) A note on preemptive scheduling with earliness and tardiness costs. Production Planning and Control 7: pp. 401406 CrossRef
 Nandkeolyar, U., Ahmed, M., Sundararaghavan, P. (1993) Dynamic singlemachineweighted absolute deviation problem: predictive heuristics and evaluation. International Journal of Production Research 31: pp. 14531466 CrossRef
 Ovacik, I. M., Uzsoy, R. (1997) Decomposition methods for complex factory scheduling problems. Kluwer Academic, Boston
 Phillips, C., Stein, C., Wein, J. (1998) Minimizing average completion time in the presence of release dates. Mathematical Programming 82: pp. 199223
 Potts, C., Wassenhove, L. (1982) A decomposition algorithm for the single machine total tardiness problem. Operations Research Letters 1: pp. 177181 CrossRef
 Sourd, F. (2004) The continuous assignment problem and its application to preemptive and nonpreemptive scheduling with irregular cost functions. INFORMS Journal on Computing 16: pp. 198208 CrossRef
 Sourd, F., KedadSidhoum, S. (2003) The onemachine problem with earliness and tardiness penalties. Journal of Scheduling 6: pp. 533549 CrossRef
 Sridharan, V., Zhou, Z. (1996) A decision theory based scheduling procedure for singlemachine weighted earliness and tardiness problems. European Journal of Operational Research 94: pp. 292301 CrossRef
 Srinivasan, V. (1971) A hybrid algorithm for the one machine sequencing problem to minimize total tardiness. Naval Research Logistics Quarterly 18: pp. 317327 CrossRef
 Szwarc, W. (1993) Adjacent orderings in singlemachine scheduling with earliness and tardiness penalties. Naval Research Logistics 40: pp. 229243 CrossRef
 Szwarc, W., Mukhopadhyay, S. (1995) Optimal timing schedules in earlinesstardiness single machine sequencing. Naval Research Logistics 42: pp. 11091114 CrossRef
 Ventura, J., Radhakrishnan, S. (2003) Single machine scheduling with symmetric earliness and tardiness penalties. European Journal of Operational Research 144: pp. 598612 CrossRef
 Verma, S., Dessouky, M. (1998) Singlemachine scheduling of unittime jobs with earliness and tardiness penalties. Mathematics of Operations Research 23: pp. 930943
 Wan, G., Yen, B. (2002) Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties. European Journal of Operational Research 142: pp. 271281 CrossRef
 Yano, C. A., Kim, Y. D. (1991) Algorithms for a class of singlemachine weighted tardiness and earliness problems. European Journal of Operational Research 52: pp. 167178 CrossRef
 Title
 Preemption in single machine earliness/tardiness scheduling
 Journal

Journal of Scheduling
Volume 10, Issue 45 , pp 271292
 Cover Date
 20071001
 DOI
 10.1007/s1095100700286
 Print ISSN
 10946136
 Online ISSN
 10991425
 Publisher
 Springer US
 Additional Links
 Topics
 Keywords

 Singlemachine scheduling
 Earliness
 Tardiness
 Preemption
 Transportation problem
 Industry Sectors
 Authors

 Kerem Bülbül ^{(1)}
 Philip Kaminsky ^{(2)}
 Candace Yano ^{(2)} ^{(3)}
 Author Affiliations

 1. Manufacturing Systems and Industrial Engineering, Sabancı University, Istanbul, Turkey
 2. Industrial Engineering and Operations Research, University of California, Berkeley, CA, USA
 3. Haas School of Business, University of California, Berkeley, CA, USA