Anticipation and flexibility in dynamic scheduling

References

• Adam , N and Surkis , J . 1980 . Priority update intervals and anomalies in dynamic ratio type job shop scheduling rules . Manage. Sci. , 26 : 1227 – 1237 .
   Web of Science ®Google Scholar
• Baker K Introduction to Sequencing and Scheduling 1974 Wiley New York
   Google Scholar
• Baker , KR . 1977 . An experimental study of the effectiveness of rolling schedules in production planning . Decis. Sci. , 8 : 19 – 27 .
   Google Scholar
• Bierwirth , C and Mattfeld , DC . 1999 . Production scheduling and rescheduling with genetic algorithms . Evolut. Comput. , 7 ( 1 ) : 1 – 18 .
   PubMed Web of Science ®Google Scholar
• Bierwirth C Mattfeld DC Kopfer H On permutation representations for scheduling problems Parallel Problem Solving from Nature IV edited by H.-M. Voigt, W. Ebeling, I. Rechenberg and H.-P. Schwefel pp. 310–318 1996 Springer New York
   Google Scholar
• Blanton JL Wainwright RL Multiple vehicle routing with time and capacity constraints using genetic algorithms Proceedings of the 5th International Conference on Genetic Algorithms edited by S. Forrest pp. 452–459 1993 Morgan Kaufmann San Mateo CA
   Google Scholar
• Branke J Evolutionary Optimization in Dynamic Envionments 2001 Kluwer Dordrecht
   Google Scholar
• Branke J Mattfeld D Anticipation in dynamic optimization: the scheduling case Parallel Problem Solving from Nature (PPSN VI) edited by M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J.J. Merelo and H.-P. Schwefel 1917 LNCS pp. 253–262 2000 Springer New York
   Google Scholar
• Chang , A-Y , Whitehouse , DJ , Chang , S-L and Hsieh , Y-C . 2001 . An approach to the measurement of single-machine flexibility . Int. J. Prod. Res. , 39 ( 8 ) : 1589 – 1601 .
   Web of Science ®Google Scholar
• Cheng , R , Gen , M and Tsujimura , Y . 1996 . A tutorial survey of job-shop scheduling problems using genetic algorithms . Comput. Ind. Eng. , 30 : 983 – 997 .
   Web of Science ®Google Scholar
• Cheng , R , Gen , M and Tsujimura , Y . 1999 . A tutorial survey of job-shop scheduling problem using genetic algorithms—II: hybrid genetic search strategies . Comput. Ind. Eng. , 36 : 343 – 364 .
   Web of Science ®Google Scholar
• Church , L and Uzsoy , R . 1992 . Analysis of periodic and event-driven rescheduling policies in dynamic shops . Int. J. Comput. Integ. Manuf. , 5 : 153 – 163 .
   Web of Science ®Google Scholar
• Davis L Handbook of Genetic Algorithms 1991 Van Nostrand Reinhold New York
   Google Scholar
• Della Croce , F , Tadei , R and Volta , G . 1995 . A genetic algorithm for the job shop problem . Comput. Operat. Res. , 22 : 15 – 24 .
   Web of Science ®Google Scholar
• Drexl , A . 1991 . Scheduling of project networks by job assignment . Manage. Sci. , 37 : 1590 – 1602 .
   Web of Science ®Google Scholar
• Fang , J and Xi , Y . 1997 . A rolling horizon job shop rescheduling strategy in the dynamic environment . Int. J. Adv. Manuf. Technol. , 13 ( 3 ) : 227 – 232 .
   Web of Science ®Google Scholar
• Farn , C-K and Muhlemann , A . 1979 . The dynamic aspects of a production scheduling problem . Int. J. Prod. Res. , 17 : 15 – 21 .
   Web of Science ®Google Scholar
• French S Sequencing and Scheduling; An Introduction to the Mathematics of the Job-shop 1982 Ellis Horwood New York
   Google Scholar
• Goldberg DE Genetic Algorithms 1989 Addison-Wesley Reading MA
   Google Scholar
• Gupta , YP and Somers , TM . 1992 . The measurement of manufacturing flexibility . Eur. J. Operat. Res. , 60 : 166 – 182 .
   Web of Science ®Google Scholar
• Hall , NG and Potts , CN . 2004 . Rescheduling for new orders . Operat. Res. , 52 ( 3 ) : 440 – 453 .
   Web of Science ®Google Scholar
• Haupt , R . 1989 . A survey of priority rule-based scheduling . Operat. Res. Spek. , 11 : 3 – 16 .
   Google Scholar
• Holthaus , O and Rajendran , C . 1997 . Efficient dispatching rules for scheduling in a job shop . Int. J. Prod. Econ. , 48 : 87 – 105 .
   Web of Science ®Google Scholar
• Jain , AK and Elmaraghy , HA . 1997 . Production scheduling/rescheduling in flexible manufacturing . Int. J. Prod. Res. , 35 ( 1 ) : 281 – 309 .
   Web of Science ®Google Scholar
• Jensen , MT . 2001 . Improving robustness and flexibility of tardiness and total flow time job shops using robustness measures . Appl. Soft Comput. , 4 : 1 – 18 .
   Google Scholar
• Kimenmia , J and Gershwin , SB . 1983 . An algorithm for the computer control of a flexible manufacturing system . IIE Trans. , 15 : 353 – 362 .
   Web of Science ®Google Scholar
• Kutanoglu E Wu SD Improving Schedule Robustness via Stochastic Analysis and Dynamic Adaptation Technical Report 98T-001 Lehigh University 1998
   Google Scholar
• Leon , VJ , Wu , SD and Storer , RH . 1994 . Robustness measures and robust scheduling for job shops . IIE Trans. , 26 ( 5 ) : 32 – 43 .
   Web of Science ®Google Scholar
• Li , R-K , Shyu , Y-T and Adiga , S . 1993 . A heuristic rescheduling algorithm for computer-based production scheduling systems . Int. J. Prod. Res. , 31 ( 8 ) : 1815 – 1826 .
   Web of Science ®Google Scholar
• Lin S-C Goodman ED Punch WF A genetic algorithm approach to dynamic job shop scheduling problems International Conference on Genetic Algorithms edited by T. Bäck pp. 481–488 1997 Morgan Kaufmann San Mateo CA
   Google Scholar
• Mattfeld D Scalable search spaces for scheduling problems Genetic and Evolutionary Computation Conference edited by W. Banzaf, J. Daida, A. Eiben, M. Garzon, V. Honavar, M. Jakiela, and R. Smith pp. 1616–1621 1999 Morgan Kaufmann San Mateo CA
   Google Scholar
• Mehta , S and Uzsoy , R . 1998 . Predictable scheduling of a job-shop subject to breakdowns . IEEE Trans. Robot. Automat. , 14 ( 3 ) : 365 – 378 .
   Google Scholar
• Michalewicz Z Genetic Algorithms + Data Structures = Evolution Programs 3rd edn 1996 Springer New York
   Google Scholar
• Morton TE Pentico DW Heuristic Scheduling Systems 1993 Wiley Chichester UK
   Google Scholar
• Muhlemann , A , Lockett , A and Farn , C-K . 1982 . Job shop scheduling heuristics and frequencies of scheduling . Int. J. Prod. Res. , 20 : 227 – 241 .
   Web of Science ®Google Scholar
• Norman , B and Bean , J . 1997 . A random keys genetic algorithm for job shop scheduling problems . Eng. Design Automat. J. , 3 : 145 – 156 .
   Google Scholar
• Pagell , M , Newman , WR , Hanna , MD and Krause , DR . 2000 . Uncertainty, flexibility, and buffers: three case studies . Prod. Invent. Manage. J. , 41 ( 1 ) : 35 – 43 .
   Google Scholar
• Pereira , J and Paulré , B . 2001 . Flexibility in manufacturing systems: a relational and a dynamic approach . Eur. J. Operat. Res. , 139 : 70 – 82 .
   Web of Science ®Google Scholar
• Persentili , E and Alptekin , SE . 2000 . Product flexibility in selecting manufacturing planning and control strategy . Int. J. Prod. Res. , 38 ( 9 ) : 2011 – 2021 .
   Web of Science ®Google Scholar
• Pierreval , H and Mebarki , N . 1997 . Dynamic selection of dispatching rules for manufacturing system scheduling . Int. J. Prod. Res. , 35 ( 6 ) : 1575 – 1591 .
   Web of Science ®Google Scholar
• Ponnambalam , SG , Aravindan , P and Rao , PS . 2001 . Comparative evaluation of genetic algorithms for job-shop scheduling . Prod. Plan. Cont. , 12 : 560 – 574 .
   Web of Science ®Google Scholar
• Powell WB Towns MT Marar A On the Value of Optimal Myopic Solutions for Dynamic Routing and Scheduling Problems in the Presence of User Non-compliance Technical Report SOR-97-15 Princeton University Princeton NJ 1998
   Google Scholar
• Raghu , TS and Rajendran , C . 1993 . An efficient dynamic dispatching rule for scheduling in a job shop . Int. J. Prod. Econ. , 32 : 301 – 313 .
   Web of Science ®Google Scholar
• Rajendran , C and Holthaus , O . 1999 . A comparative study of dispatching rules in dynamic flowshops and jobshops . Eur. J. Operat. Res. , 116 : 156 – 170 .
   Web of Science ®Google Scholar
• Raman , N and Talbot , FB . 1993 . The job shop tardiness problem: a decomposition approach . Eur. J. Operat. Res. , 69 : 187 – 199 .
   Web of Science ®Google Scholar
• Russel , R , Dar-El , E and Taylor , B . 1987 . A comparative analysis of the COVERT job sequencing rule using various shop performance measures . Int. J. Prod. Res. , 25 : 1523 – 1540 .
   Web of Science ®Google Scholar
• Snoek M Anticipation optimization in dynamic job shops GECCO Workshop on Evolutionary Algorithms for Dynamic Optimization Problems pp. 43–46 2001
   Google Scholar
• Stadler H Production planning and scheduling Supply Chain Management and Advanced Planning edited by H. Stadler and C. Kilger, 3rd edn pp. 197–214 2005 Springer New York
   Google Scholar
• Storer , R , Wu , D and Vaccari , R . 1992 . New search spaces for sequencing problems with application to job shop scheduling . Manuf. Sci. , 38 : 1495 – 1509 .
   Web of Science ®Google Scholar
• Whitley D Permutations Evolutionary Computation 1 edited by T. Bäck, D. Fogel and T. Michalewicz pp. 139–150 2000 IOP Press New York
   Google Scholar
• Wu SD Storer RH Chang P-C A rescheduling procedure for manufacturing systems under random disruptions New Directions for Operations Research in Manufacturing edited by G. Fandel, T. Gulledge and A. Jones pp. 292–308 1992 Springer New York
   Google Scholar
• Yamamoto , M and Nof , S . 1985 . Scheduling/rescheduling in the manufacturing operating system environment . Int. J. Prod. Res. , 23 : 705 – 722 .
   Web of Science ®Google Scholar
• Yellig , EJ and Mackulak , GT . 1997 . Robust deterministic scheduling in stochastic environments: the method of capacity hedge points . Int. J. Prod. Res. , 35 ( 2 ) : 369 – 379 .
   Web of Science ®Google Scholar