Extending the boundaries between scheduling and dispatching: hedging and rescheduling techniques

References

• Bean, J. C., J. Birge, J. Mittenthal, and C. Noon. 1991. “Matchup Scheduling with Multiple Resources, Release Dates and Disruptions.” Operations Research 39: 470–483.10.1287/opre.39.3.470
   Web of Science ®Google Scholar
• Byeon, E., D. Wu, and R. Storer. 1998. “Decomposition Heuristics for Robust Job Shop Scheduling.” IEEE Transactions on Robotics and Automation 14: 303–313.10.1109/70.681248
   Google Scholar
• Cao, Q., J. W. Patterson, and T. E. Griffin. 2001. “On the Operational Definition of Processing Time Uncertainty.” International Journal of Production Research 39: 2833–2849.10.1080/00207540110051833
   Web of Science ®Google Scholar
• Choi, S. H., and K. Wang. 2012. “Flexible Flow Shop Scheduling with Stochastic Processing Times: A Decomposition-based Approach.” Computers & Industrial Engineering 63 (2): 362–373.10.1016/j.cie.2012.04.001
   Web of Science ®Google Scholar
• Church, L., and R. Uzsoy. 1992. “Analysis of Periodic and Event Drive Rescheduling Policies in Dynamic Shops.” International Journal of Computer-Integrated Manufacturing 5: 153–163.10.1080/09511929208944524
   Web of Science ®Google Scholar
• Daniels, R., and P. Kouvelis. 1995. “Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-stage Production.” Management Science 41: 363–376.10.1287/mnsc.41.2.363
   Web of Science ®Google Scholar
• De, P., J. Ghosh, and C. Wells. 1992. “Expectation-variance Analysis of Job Sequences Under Processing Time Uncertainty.” International Journal of Production Economics 28: 289–297.10.1016/0925-5273(92)90017-2
   Web of Science ®Google Scholar
• Derringer, G., and R. Suich. 1980. “Simultaneous Optimization of Several Response Variables.” Journal of Quality Technology 12: 214–219.
   Web of Science ®Google Scholar
• Dong, Y. H., and J. Jang. 2012. “Production Rescheduling for Machine Breakdown at a Job Shop.” International Journal of Production Research 50 (10): 2681–2691.10.1080/00207543.2011.579637
   Web of Science ®Google Scholar
• Emmons, H., and M. Pinedo. 1990. “Scheduling Stochastic Jobs with Due Dates on Parallel Machines.” European Journal of Operational Research 47 (1): 49–55.
   Web of Science ®Google Scholar
• Goren, S., I. Sabuncuoglu, and U. Koc. 2012. “Optimization of Schedule Stability and Efficiency Under Processing Time Variability and Random Machine Breakdowns in a Job Shop Environment.” Naval Research Logistics (NRL) 59 (1): 26–38.10.1002/nav.v59.1
   Web of Science ®Google Scholar
• Herrmann, J. W. 1999. “A Genetic Algorithm for Minimax Optimization Problems.” In Proceedings of the 1999 Congress on Evolutional Computation, 1099–1103.10.1109/CEC.1999.782545
   Google Scholar
• Ibarra, O., and C. Kim. 1977. “Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors.” Journal of the ACM 24: 280–289.10.1145/322003.322011
   Web of Science ®Google Scholar
• Katragjini, K., E. Vallada, and R. Ruiz. 2013. “Flow Shop Rescheduling Under Different Types of Disruption.” International Journal of Production Research 51 (3): 780–797.10.1080/00207543.2012.666856
   Web of Science ®Google Scholar
• Kuster, J., D. Jannach, and G. Friedrich. 2010. “Applying Local Rescheduling in Response to Schedule Disruptions.” Annals of Operations Research 180 (1): 265–282.10.1007/s10479-008-0488-x
   Web of Science ®Google Scholar
• Lawrence, S., and E. Sewell. 1997. “Heuristic, Optimal, Static, and Dynamic Schedules when Processing Time is Uncertain.” Journal of Operations Management 15: 71–82.10.1016/S0272-6963(96)00090-3
   Google Scholar
• Leon, V., S. Jorge, D. Wu, and R. Storer. 1994. “Robustness Measures and Robust Scheduling for Job Shops.” IIE Transactions 26: 32–43.10.1080/07408179408966626
   Web of Science ®Google Scholar
• Luh, P., D. Chen, and L. Thakur. 1999. “An Effective Approach for Job-shop Scheduling with Uncertain Processing Requirements.” IEEE Transactions on Robotics and Automation 15: 328–339.10.1109/70.760354
   Google Scholar
• Merdan, M., T. Moser, P. Vrba, and S. Biffl. 2011. “Investigating the Robustness of Re-scheduling Policies with Multi-agent System Simulation.” The International Journal of Advanced Manufacturing Technology 55 (1–4): 355–367.10.1007/s00170-010-3049-9
   Web of Science ®Google Scholar
• Metha, S., and R. Uzsoy. 1998. “Predictable Scheduling of a Job Shop Subject to Breakdowns.” IEEE Transactions on Robotics and Automation 14: 365–378.
   Google Scholar
• Ozlen, M., and M. Azizoğlu. 2011. “Rescheduling Unrelated Parallel Machines with Total Flow Time and Total Disruption Cost Criteria.” Journal of the Operational Research Society 62 (1): 152–164.10.1057/jors.2009.157
   Web of Science ®Google Scholar
• Pfund, M., J. Fowler, and M. Carlyle. 2002. “An Evaluation of Scheduling and Dispatching Algorithms in High Tech Manufacturing Environments with Uncertainty.” In FAIM Conference Proceedings, 1224–1230.
   Google Scholar
• Pfund, M., L. Yu, M. Carlyle, and J. Fowler. 2002. “The Effects of Processing Time Variability and Equipment Downtimes on Various Scheduling Approaches for a Printed Wiring Board Assembly Operation.” Journal of Electronics Manufacturing 11: 19–31.10.1142/S0960313102000242
   Google Scholar
• Pfund, M. E., S. J. Mason, and J. W. Fowler. 2006. “Semiconductor Manufacturing Scheduling and Dispatching.” In Handbook of Scheduling, edited by J. W. Herrmann, 213–242. New York: Springer International Series.
   Google Scholar
• Pinedo, M. 2012. Scheduling Theory, Algorithms, and Systems. 4th ed. New York: Springer.
   Google Scholar
• Pritsker, A. 1995. Introduction to Simulation and Slam II. New York: John Wiley and Sons.
   Google Scholar
• Ranjbar, M., M. Davari, and R. Leus. 2012. “Two Branch-and-Bound Algorithms for the Robust Parallel Machine Scheduling Problem.” Computers & Operations Research 39 (7): 1652–1660.
   Web of Science ®Google Scholar
• Rockefeller, R. T., and R. J. Wets. 1991. “Scenarios and Policy Aggregation in Optimization Under Uncertainty.” Mathematics of Operations Research 16: 119–147.10.1287/moor.16.1.119
   Web of Science ®Google Scholar
• Sabuncuoglu, I., and S. Goren. 2009. “Hedging Production Schedules Against Uncertainty in Manufacturing Environment with a Review of Robustness and Stability Research.” International Journal of Computer Integrated Manufacturing 22 (2): 138–157.10.1080/09511920802209033
   Web of Science ®Google Scholar
• Sabuncuoglu, I., and S. Karabuk. 1999. “Rescheduling Frequency in an FMS with Uncertain Processing Times and Unreliable Machines.” Journal of Manufacturing Systems 18: 268–283.10.1016/S0278-6125(00)86630-3
   Web of Science ®Google Scholar
• Shafaei, R., and P. Brunn. 1999. “Workshop Scheduling Using Practical (Inaccurate) Data – Part 1: The Performance of Heuristic Scheduling Rules in a Dynamic Job Shop Environment Using a Rolling Time Horizon Approach.” International Journal of Production Research 37: 3913–3925.10.1080/002075499189835
   Web of Science ®Google Scholar
• Skutella, M., and M. Uetz. 2005. “Stochastic Machine Scheduling with Precedence Constraints.” SIAM Journal on Computing 34 (4): 788–802.10.1137/S0097539702415007
   Web of Science ®Google Scholar
• Skutella, M., M. Sviridenko, and M. Uetz. 2016. “Unrelated Machine Scheduling with Stochastic Processing Times.” Mathematics of Operations Research 41 (3): 851–864.10.1287/moor.2015.0757
   Web of Science ®Google Scholar
• Tan, Y., and M. Aufenanger. 2011. “A Real-time Rescheduling Heuristic Using Decentralized Knowledge-based Decisions for Flexible Flow Shops with Unrelated Parallel Machines.” In 2011 9th IEEE International Conference on Industrial Informatics (INDIN), 431–436. Lisbon, Portugal: IEEE.
   Google Scholar
• Tsukada, T. 1996. “PRIAM: Polite Rescheduler for Intelligent Automated Manufacturing.” IEEE Transactions on Robotics and Automation 12: 235–245.10.1109/70.488943
   Google Scholar
• Vieira, G., J. Herrmann, and E. Lin. 2000a. “Predicting the Performance of Rescheduling Strategies for Parallel Machine Systems.” Journal of Manufacturing Systems 19: 256–266.10.1016/S0278-6125(01)80005-4
   Web of Science ®Google Scholar
• Vieira, G., J. Herrmann, and E. Lin. 2000b. “Predicting the Performance of Rescheduling Strategies for Single Machine Systems.” International Journal of Production Research 38: 1899–1915.10.1080/002075400188654
   Web of Science ®Google Scholar
• Vieira, G., and J. Herrmann. 2003. “Rescheduling Manufacturing Systems: A Framework of Strategies, Policies, and Methods.” Journal of Scheduling 6: 35–58.
   Web of Science ®Google Scholar
• Wang, K., and S. H. Choi. 2010. “Decomposition-based Scheduling for Make-span Minimization of Flexible Flow Shop with Stochastic Processing Times.” Engineering Letters, 18 (1), EL_18_1_09.
   Google Scholar
• Weber, R. R. 1982. “Scheduling Jobs by Stochastic Processing Requirements on Parallel Machines to Minimize Makespan or Flowtime.” Journal of Applied Probability 19 (1): 167–182.
   Web of Science ®Google Scholar
• Wu, S., E. Byeon, and R. Storer. 1999. “A Graph-theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness.” Operations Research 47: 113–124.10.1287/opre.47.1.113
   Web of Science ®Google Scholar
• Yan, H. S., N. S. Wang, J. G. Zhang, and X.Y., Cui. 1998. “Modeling, Scheduling and Simulation for Flexible Robust Manufacturing Systems Using Extended Stochastic High-level Evaluation Petri Nets.” Robotics and Computer-Integrated Manufacturing 14: 121–140.10.1016/S0736-5845(97)00019-7
   Web of Science ®Google Scholar
• Yang, T. 2009. “An Evolutionary Simulation–Optimization Approach in Solving Parallel-machine Scheduling Problems – A Case Study.” Computers & Industrial Engineering 56 (3): 1126–1136.10.1016/j.cie.2008.09.026
   Web of Science ®Google Scholar
• Yellig, E. J., and G. T. Mackulak. 1997. “Deterministic Scheduling in Stochastic Environments: The Method of Capacity Hedge Points.” International Journal of Production Research 35: 369–379.10.1080/002075497195803
   Web of Science ®Google Scholar
• Yu, L., H. Shih, M. Pfund, W. Carlyle, and J. Fowler. 2002. “Scheduling of Unrelated Parallel Machines: An Application to PWB Manufacturing.” IIE Transactions 34 (11): 921–931.
   Web of Science ®Google Scholar
• Zakaria, Z., and S. Petrovic. 2012. “Genetic Algorithms for Match-up Rescheduling of the Flexible Manufacturing Systems.” Computers & Industrial Engineering 62 (2): 670–686.10.1016/j.cie.2011.12.001
   Web of Science ®Google Scholar
• Zhang, L., L. Gao, and X. Li. 2013. “A Hybrid Genetic Algorithm and Tabu Search for a Multi-objective Dynamic Job Shop Scheduling Problem.” International Journal of Production Research 51 (12): 3516–3531.10.1080/00207543.2012.751509
   Web of Science ®Google Scholar