New Precedence Theorems for One-Machine Weighted Tardiness

References

• Abdul-Razaq T. S., Potts C. N., Van Wassenhove L. N. A survey of algorithms for single machine total weighted tardiness scheduling problems. Discrete Appl. Math. (1990) 26(2–3):235–253Crossref, Google Scholar
• Akturk M. S., Yildirim M. B. A new dominance rule for the total weighted tardiness problem. Production Planning Control (1999) 10(2):138–149Crossref, Google Scholar
• Arkin E. M., Roundy R. O. Weighted-tardiness scheduling on parallel machines with proportional weights. Oper. Res. (1991) 39:64–81Link, Google Scholar
• Baker K. R., Bertrand J. W. M. A dynamic priority rule for scheduling against due-dates. J. Oper. Management (1982) 3(1):37–42Crossref, Google Scholar
• Baker K. R., Kanet J. J. Job shop scheduling with modified due dates. J. Oper. Management (1983) 4(1):11–22Crossref, Google Scholar
• Della Croce F., Tadei R., Baracco P., Grosso A. A new decomposition approach for the single machine total tardiness scheduling problem. J. Oper. Res. Soc. (1998) 49:1101–1106Crossref, Google Scholar
• Emmons H. One-machine sequencing to minimize certain functions of job tardiness. Oper. Res. (1969) 17:701–715Link, Google Scholar
• Fisher M. A dual algorithm for the one-machine scheduling problem. Math. Programming (1976) 11:229–251Crossref, Google Scholar
• Gelders L., Kleindorfer P. R. Coordinating aggregate and detailed scheduling in the one-machine job shop I: Theory. Oper. Res. (1974) 22:46–60Link, Google Scholar
• Gelders L., Kleindorfer P. R. Coordinating aggregate and detailed scheduling in the one-machine job shop II: Computation and structure. Oper. Res. (1975) 23:312–324Link, Google Scholar
• Graham R. L., Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G. Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discrete Math. (1979) 4:287–326Crossref, Google Scholar
• Kanet J. J., Li X. On adjacent job precedence for 1‖∑ wjTj. (2003) . Working paper, University of Dayton, Dayton, OHGoogle Scholar
• Kanet J. J., Li X. A weighted modified due date rule for sequencing to minimize weighted tardiness. J. Scheduling (2004) 7:263–278Crossref, Google Scholar
• Lawler E. A. “Pseudopolynomial” algorithm for sequencing jobs to minimize total tardiness. Ann. Discrete Math. (1977) 1:331–342Crossref, Google Scholar
• Lawler E. L. Efficient implementation of dynamic programming algorithms for sequencing problems. (1979) . Report BW 106, Mathematisch Centrum, Amsterdam, The NetherlandsGoogle Scholar
• Lee Y. H., Bhaskaran K., Pinedo M. A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Trans. (1997) 29:45–52Crossref, Google Scholar
• Mason S. J., Fowler J. W., Carlyle W. M. A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops. J. Scheduling (2002) 5(3):247–262Crossref, Google Scholar
• Potts C. N., van Wassenhove L. N. A decomposition algorithm for the single machine total tardiness problem. Oper. Res. Lett. (1982) 1:177–182Crossref, Google Scholar
• Potts C. N., van Wassenhove L. N. A branch and bound algorithm for the total weighted tardiness problem. Oper. Res. (1985) 33:363–377Link, Google Scholar
• Rachamadugu R. M. V. A note on the weighted tardiness problem. Oper. Res. (1987) 35:450–451Link, Google Scholar
• Rinnooy Kan A. H. G., Lageweg B. J., Lenstra J. K. Minimizing total costs in one-machine scheduling. Oper. Res. (1975) 23:908–927Link, Google Scholar
• Schrage L. E., Baker K. R. Dynamic programming solution of sequencing problems with precedence constraints. Oper. Res. (1978) 26:444–449Link, Google Scholar
• Sen T., Sulek J. M., Dileepan P. Static scheduling research to minimize weighted and unweighted tardiness: A state-of-the-art survey. Internat J. Production Econom. (2003) 83:1–12Crossref, Google Scholar
• Srinivasan V. A hybrid algorithm for the one-machine sequencing problem to minimize total tardiness. NRLQ (1971) 18:317–327Crossref, Google Scholar
• Szwarc W., Liu J. J. Weighted tardiness single machine scheduling with proportional weights. Management Sci. (1993) 39:626–632Link, Google Scholar
• Szwarc W., Della Croce F., Grosso A. Solution of the single machine total tardiness problem. J. Scheduling (1999) 2:55–71Crossref, Google Scholar
• Szwarc W., Grosso A., Della Croce F. Algorithmic paradoxes of the single-machine total tardiness problem. J. Scheduling (2001) 4:93–104Crossref, Google Scholar
• Tansel B. C., Kara B. Y., Sabuncuoğlu I. An efficient algorithm for the single machine total tardiness problem. IIE Trans. (2001) 33:661–674Crossref, Google Scholar
• Vepsalainen A. P., Morton T. E. Priority rules for job shops with weighted tardiness costs. Management Sci. (1987) 33:1035–1047Link, Google Scholar