Rescheduling for Multiple New Orders

Published Online:https://doi.org/10.1287/ijoc.1060.0209

References

  • Aytug H., Lawley M. A., McKay K., Mohan S., Uzsoy R. Executing production schedules in the face of uncertainties: A review and some future directions. Eur. J. Oper. Res. (2004) 161:86–110CrossrefGoogle Scholar
  • Baker K. R., Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G. Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints. Oper. Res. (1983) 31:381–386LinkGoogle Scholar
  • Bean J. C., Birge J. R., Mittenthal J., Noon C. E. Matchup scheduling with multiple resources, release dates and disruptions. Oper. Res. (1991) 39:470–483LinkGoogle Scholar
  • Brucker P.Scheduling Algorithms (1998) 2nd ed.(Springer, Berlin, Germany) CrossrefGoogle Scholar
  • Carlier J. The one-machine sequencing problem. Eur. J. Oper. Res. (1982) 11:42–47CrossrefGoogle Scholar
  • Clausen J., Hansen J., Larsen J., Larsen A. Disruption management. OR/MS Today (2001) 28(October):40–43Google Scholar
  • Davenport A. J., Beck J. C. A survey of techniques for scheduling under uncertainty. (2000) . Working paper, IBM T. J. Watson Research Center, Yorktown Heights, NYGoogle Scholar
  • Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (Freeman, San Francisco, CA) 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–326CrossrefGoogle Scholar
  • Grigoriev A., Holthuijsen M., van de Klundert J. Basic scheduling problems with raw materials constraints. Naval Res. Logist. (2005) 52:527–535CrossrefGoogle Scholar
  • Hall L. A., Shmoys D. B. Jackson's rule for single-machine scheduling: Making a good heuristic better. Math. Oper. Res. (1992) 17:22–35LinkGoogle Scholar
  • Hall N. G., Posner M. E. Generating experimental data for computational testing with machine scheduling applications. Oper. Res. (2001) 49:854–865LinkGoogle Scholar
  • Hall N. G., Potts C. N. Rescheduling for new orders. Oper. Res. (2004) 52:440–453LinkGoogle Scholar
  • Hall N. G., Potts C. N. Rescheduling for job unavailability. Oper. Res. (2007) . ForthcomingGoogle Scholar
  • Hansen P., Mladenović N. Variable neighborhood search: Principles and applications. Eur. J. Oper. Res. (2001) 130:449–467CrossrefGoogle Scholar
  • Herroelen W., Leus R. Project scheduling under uncertainty: Survey and research potentials. Eur. J. Oper. Res. (2005) 165:289–306CrossrefGoogle Scholar
  • Jackson J. R. Scheduling a production line to minimize maximum tardiness. (1955) . Research Report 43, Management Science Research Project, University of California, Los Angeles, CAGoogle Scholar
  • Pan Y. P. An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time. Oper. Res. Lett. (2003) 31:492–496CrossrefGoogle Scholar
  • Papadimitriou C. H., Steiglitz K.Combinatorial Optimization: Algorithms and Complexity (1982) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
  • Posner M. E. Minimizing weighted completion times with deadlines. Oper. Res. (1985) 33:562–574LinkGoogle Scholar
  • Potts C. N., Van Wassenhove L. N. Algorithm for single machine sequencing with deadlines to minimize total weighted completion time. Eur. J. Oper. Res. (1983) 12:379–387CrossrefGoogle Scholar
  • Schuurman P., Woeginger G. J., Möhring R. H., Potts C. N., Schulz A. S., Woeginger G. J., Wolsey L. A. Approximation schemes—A tutorial. Lectures in Scheduling (2007) . ForthcomingGoogle Scholar
  • Szelke E., Kerr R. M. Knowledge-based reactive scheduling. Production Planning Control (1994) 5:124–145CrossrefGoogle Scholar
  • Unal A. T., Uzsoy R., Kiran A. S. Rescheduling on a single machine with part-type dependent setup times and deadlines. Ann. Oper. Res. (1997) 70:93–113CrossrefGoogle Scholar
  • Vieira G. E., Herrmann J. W., Lin E. Rescheduling manufacturing systems: A framework of strategies, policies and methods. J. Scheduling (2003) 6:39–62CrossrefGoogle Scholar
  • Wu S. D., Storer R. H., Chang P.-C. One-machine rescheduling heuristics with efficiency and stability as criteria. Comput. Oper. Res. (1993) 20:1–14CrossrefGoogle Scholar
  • Yu G., Argüello M., Song G., McCowan S. M., White A. A new era for crew recovery at Continental Airlines. Interfaces (2003) 33:5–22LinkGoogle Scholar
  • Zweben M., Davis E., Daun B., Deale M. J. Scheduling and rescheduling with iterative repair. IEEE Trans. Systems, Man, Cybernetics (1993) 23:1588–1596CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.