Scheduling with Fixed Delivery Dates

References

• Achugbue J. O., Chin F. Y. Scheduling the open shop to minimize mean flow time. SIAM J. Comput. (1982) 11:709–720Crossref, Google Scholar
• Blum N., Floyd R. W., Pratt V., Rivest R. L., Tarjan R. E. Time bounds for selection. J. Comput. Systems Sci. (1973) 7:448–461Crossref, Google Scholar
• Garey M. R., Johnson D. S. Strong NP-completeness results: motivation, examples and implications. J. Assoc. Comput. Machinery (1978) 25:499–508Crossref, Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (Freeman, San Francisco) Google Scholar
• Garey M. R., Johnson D. S., Sethi R. The complexity of flowshop and job-shop scheduling. Math. Oper. Res. (1976) 1:117–129Link, Google Scholar
• Gonzalez T., Sahni S. Open shop scheduling to minimize finish time. J. Assoc. Comput. Machinery (1976) 23:665–679Crossref, Google Scholar
• Graham R. L., Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G. Optimization and approximation in deterministic machine scheduling: a survey. Ann. Discrete Math. (1979) 5:287–326Crossref, Google Scholar
• Hall N. G., Lesaoana M., Potts C. N. Scheduling with fixed delivery dates. (1999) . The full text of this paper can be found at the Operations Research Home Page in the Online Collection. The Home Page can be accessed via 〈www.informs.org〉Google Scholar
• Jackson J. R. Scheduling a production line to minimize maximum tardiness. (1995) . Research Report 43, Management Science Research Project, University of California, Los AngelesGoogle Scholar
• Jackson J. R. An extension of Johnson's results on job lot scheduling. Naval Res. Logist. (1956) 3:201–203Crossref, Google Scholar
• Johnson S. M. Optimal two- and three-stage production schedules with setup times included. Naval Res. Logist. (1954) 1:61–67Crossref, Google Scholar
• Karp R. M., Miller R. E., Thatcher J. W. Reducibility among combinatorial problems. Complexity of Computer Computations (1972) (Plenum Press, New York) 85–103Crossref, Google Scholar
• Lawler E. L. A “pseudopolynomial” algorithm for sequencing jobs to minimize total tardiness. Ann. Discrete Math. (1977) 1:331–342Crossref, Google Scholar
• Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G. Minimizing maximum lateness in a two-machine open-shop. Math. Oper. Res. (1981) 6:153–158Erratum, 1982. Math. Oper. Res. 7 635Link, Google Scholar
• Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G., Shmoys D. B., Graves S. C., Rinnooy Kan A. H. G., Zipkin P. Sequencing and scheduling: algorithms and complexity. Handbooks in Operations Research and Management Science, Volume 4: Logistics of Production and Inventory (1993) (North-Holland, New York) 445–522Crossref, Google Scholar
• Lawler E. L., Moore J. M. A functional equation and its application to resource allocation and sequencing problems. Management Sci. (1969) 16:77–84Link, Google Scholar
• Lenstra J. K.Sequencing by Enumerative Methods (1977) (Mathematical Centre Tract 69, Centre for Mathematics and Computer Science, Amsterdam) Google Scholar
• Lesaoana M. Scheduling with Fixed Delivery Dates . (1991) . Ph.D. Thesis, University of Southampton, U.K.Google Scholar
• Matsuo H. The weighted total tardiness problem with fixed shipping times and overtime utilization. Oper. Res. (1988) 36:293–307Link, Google Scholar
• Moore J. M. An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Sci. (1968) 15:102–109Link, Google Scholar
• Pinedo M.Scheduling: Theory Algorithms and Systems (1995) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Schonhäge A., Patterson M., Pippenger N. Finding the median. J. Comput. Systems Sci. (1976) 13:184–199Crossref, Google Scholar
• Smith W. E. Various optimizers for single stage production. Naval Res. Logist. Quart. (1956) 3:59–66Crossref, Google Scholar
• Williamson D. P., Hall L. A., Hoogeveen J. A., Hurkens C. A. J., Lenstra J. K., Sevast'janov S. V., Shmoys D. B. Short shop schedules. Oper. Res. (1997) 45:288–294Link, Google Scholar