ROBUST SCHEDULES AND DISRUPTION MANAGEMENT FOR JOB SHOPS
暂无分享,去创建一个
[1] M. Polman,et al. Modeling ship arrivals in ports , 2003, Proceedings of the 2003 Winter Simulation Conference, 2003..
[2] Xiangtong Qi,et al. Disruption management in production planning , 2005 .
[3] M. Selim Akturk,et al. Match-up scheduling under a machine breakdown , 1999, Eur. J. Oper. Res..
[4] Dušan Teodorović,et al. Optimal dispatching strategy on an airline network after a schedule perturbation , 1984 .
[5] Egon Balas,et al. The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .
[6] Reha Uzsoy,et al. Predictable scheduling of a job shop subject to breakdowns , 1998, IEEE Trans. Robotics Autom..
[7] Chen Lin,et al. Disruption management in flight gate scheduling , 2007 .
[8] Bruce L. Golden,et al. Stochastic vehicle routing: A comprehensive approach , 1983 .
[9] Oktay Günlük,et al. Robust capacity planning in semiconductor manufacturing , 2005 .
[10] John R. Birge,et al. Introduction to Stochastic Programming , 1997 .
[11] Nagarajan Kandasamy,et al. Synthesis of robust task schedules for minimum disruption repair , 2004, 2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583).
[12] Gilbert Laporte,et al. Designing collection routes through bank branches , 1991, Comput. Oper. Res..
[13] James C. Bean,et al. Matchup Scheduling with Multiple Resources, Release Dates and Disruptions , 1991, Oper. Res..
[14] Alexander H. G. Rinnooy Kan,et al. Single machine flow-time scheduling with a single breakdown , 1989, Acta Informatica.
[15] Fran Ackermann,et al. The role of feedback dynamics in disruption and delay on the nature of disruption and delay (D&D) in major projects , 2000, J. Oper. Res. Soc..
[16] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .
[17] Chris N. Potts,et al. Rescheduling for Multiple New Orders , 2007, INFORMS J. Comput..
[18] G. Gallego. Scheduling the production of several items with random demands in a single facility , 1990 .
[19] Wim Nuijten,et al. Randomized Large Neighborhood Search for Cumulative Scheduling , 2005, ICAPS.
[20] Gary D. Scudder,et al. Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..
[21] David Simchi-Levi,et al. A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty , 1996, Oper. Res..
[22] Nikolaos V. Sahinidis,et al. Reformulation of the Multiperiod MILP Model for Capacity Expansion of Chemical Processes , 1992, Oper. Res..
[23] Bala Ram,et al. Bio-inspired scheduling for dynamic job shops with flexible routing and sequence-dependent setups , 2006 .
[24] S. J. Mason,et al. Rescheduling strategies for minimizing total weighted tardiness in complex job shops , 2004 .
[25] J. Carlier,et al. An algorithm for solving the job-shop problem , 1989 .
[26] A Gerodimos,et al. Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..
[27] Jeffrey W. Herrmann,et al. Rescheduling Manufacturing Systems: A Framework of Strategies, Policies, and Methods , 2003, J. Sched..
[28] Sanjay Mehta,et al. Predictable scheduling of a single machine subject to breakdowns , 1999, Int. J. Comput. Integr. Manuf..
[29] Reha Uzsoy,et al. Executing production schedules in the face of uncertainties: A review and some future directions , 2005, Eur. J. Oper. Res..
[30] John A. Stankovic,et al. Dynamic end-to-end guarantees in distributed real time systems , 1994, 1994 Proceedings Real-Time Systems Symposium.