Rescheduling for Multiple New Orders
Published Online:1 Nov 2007https://doi.org/10.1287/ijoc.1060.0209
References
- Executing production schedules in the face of uncertainties: A review and some future directions. Eur. J. Oper. Res. (2004) 161:86–110Crossref, Google Scholar
- Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints. Oper. Res. (1983) 31:381–386Link, Google Scholar
- Matchup scheduling with multiple resources, release dates and disruptions. Oper. Res. (1991) 39:470–483Link, Google Scholar
- Scheduling Algorithms (1998) 2nd ed.(Springer, Berlin, Germany) Crossref, Google Scholar
- The one-machine sequencing problem. Eur. J. Oper. Res. (1982) 11:42–47Crossref, Google Scholar
- Disruption management. OR/MS Today (2001) 28(October):40–43Google Scholar
- A survey of techniques for scheduling under uncertainty. (2000) . Working paper, IBM T. J. Watson Research Center, Yorktown Heights, NYGoogle Scholar
- Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (Freeman, San Francisco, CA) Google Scholar
- Optimization and approximation in deterministic machine scheduling: A survey. Ann. Discrete Math. (1979) 5:287–326Crossref, Google Scholar
- Basic scheduling problems with raw materials constraints. Naval Res. Logist. (2005) 52:527–535Crossref, Google Scholar
- Jackson's rule for single-machine scheduling: Making a good heuristic better. Math. Oper. Res. (1992) 17:22–35Link, Google Scholar
- Generating experimental data for computational testing with machine scheduling applications. Oper. Res. (2001) 49:854–865Link, Google Scholar
- Rescheduling for new orders. Oper. Res. (2004) 52:440–453Link, Google Scholar
- Rescheduling for job unavailability. Oper. Res. (2007) . ForthcomingGoogle Scholar
- Variable neighborhood search: Principles and applications. Eur. J. Oper. Res. (2001) 130:449–467Crossref, Google Scholar
- Project scheduling under uncertainty: Survey and research potentials. Eur. J. Oper. Res. (2005) 165:289–306Crossref, Google Scholar
- Scheduling a production line to minimize maximum tardiness. (1955) . Research Report 43, Management Science Research Project, University of California, Los Angeles, CAGoogle Scholar
- An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time. Oper. Res. Lett. (2003) 31:492–496Crossref, Google Scholar
- Combinatorial Optimization: Algorithms and Complexity (1982) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
- Minimizing weighted completion times with deadlines. Oper. Res. (1985) 33:562–574Link, Google Scholar
- Algorithm for single machine sequencing with deadlines to minimize total weighted completion time. Eur. J. Oper. Res. (1983) 12:379–387Crossref, Google Scholar
- , 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
- Knowledge-based reactive scheduling. Production Planning Control (1994) 5:124–145Crossref, Google Scholar
- Rescheduling on a single machine with part-type dependent setup times and deadlines. Ann. Oper. Res. (1997) 70:93–113Crossref, Google Scholar
- Rescheduling manufacturing systems: A framework of strategies, policies and methods. J. Scheduling (2003) 6:39–62Crossref, Google Scholar
- One-machine rescheduling heuristics with efficiency and stability as criteria. Comput. Oper. Res. (1993) 20:1–14Crossref, Google Scholar
- A new era for crew recovery at Continental Airlines. Interfaces (2003) 33:5–22Link, Google Scholar
- Scheduling and rescheduling with iterative repair. IEEE Trans. Systems, Man, Cybernetics (1993) 23:1588–1596Crossref, Google Scholar

