Stochastic Scheduling for a Network of MEMS Job Shops

This work is motivated by the pressing need for operational control in the fabrication of Microelectromechanical systems or MEMS. MEMS are miniature three-dimensional integrated electromechanical systems with the ability to absorb information from the environment, process this information and suitably react to it. These devices offer tremendous advantages owing to their small size, low power consumption, low mass and high functionality, which makes them very attractive in applications with stringent demands on weight, functionality and cost. While the system’s ‘brain’ (device electronics) is fabricated using traditional IC technology, the micromechanical components necessitate very intricate and sophisticated processing of silicon or other suitable substrates. A dearth of fabrication facilities with micromachining capabilities and a lengthy gestation period from design to mass fabrication and commercial acceptance of the product in the market are factors most often implicated in hampering the growth of MEMS. These devices are highly application specific with low production volumes and the few fabs that do possess micromachining capabilities are unable to offer a complete array of fabrication processes in order to be able to cater to the needs of the MEMS R&D community. A distributed fabrication network has, therefore, emerged to serve the evolving needs of this high investment, low volume MEMS industry. Under this environment, a central facility coordinates between a network of fabrication centers (Network of MEMS job shops – NMJS) containing micromachining capabilities. These fabrication centers include commercial, academic and government fabs, which make their services available to the ordinary customer. Wafers are shipped from one facility to another until all processing requirements are met. The lengthy and intricate process

[1]  I. Grossmann,et al.  A novel branch and bound algorithm for scheduling flowshop plants with uncertain processing times , 2002 .

[2]  Shun-Chen Niu,et al.  On Johnson's Two-Machine Flow Shop with Random Processing Times , 1986, Oper. Res..

[3]  Michel Gourgand,et al.  A contribution to the stochastic flow shop scheduling problem , 2003, Eur. J. Oper. Res..

[4]  Jerzy Kamburowski,et al.  Stochastically minimizing the makespan in two-machine flow shops without blocking , 1999, Eur. J. Oper. Res..

[5]  Peter B. Luh,et al.  An effective approach for job-shop scheduling with uncertain processing requirements , 1999, IEEE Trans. Robotics Autom..

[6]  R. Wets,et al.  L-SHAPED LINEAR PROGRAMS WITH APPLICATIONS TO OPTIMAL CONTROL AND STOCHASTIC PROGRAMMING. , 1969 .

[7]  Vipul Jain,et al.  Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems , 2001, INFORMS J. Comput..

[8]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[9]  Ivan Tanev,et al.  Hybrid evolutionary algorithm-based real-world flexible job shop scheduling problem: application service provider approach , 2004, Appl. Soft Comput..

[10]  Yoke San Wong,et al.  Machine Selection Rules in a Dynamic Job Shop , 2000 .

[11]  Andrew Y. C. Nee,et al.  A modified genetic algorithm for distributed scheduling problems , 2003, J. Intell. Manuf..

[12]  DAVID P. MORTON,et al.  A Bayesian stochastic programming approach to an employee scheduling problem , 2004 .

[13]  Y. Yoshitomi A Genetic Algorithm Approach to Solving Stochastic Job‐shop Scheduling Problems , 2002 .

[14]  Adil Baykasoğlu,et al.  Linguistic-based meta-heuristic optimization model for flexible job shop scheduling , 2002 .

[15]  Sebastian Engell,et al.  Aggregated Scheduling of a Multiproduct Batch Plant by Two-Stage Stochastic Integer Programming , 2002 .

[16]  Albert Jones,et al.  Survey of Job Shop Scheduling Techniques , 1999 .

[17]  Stéphane Dauzère-Pérès,et al.  Planning and scheduling in a multi-site environment , 1999 .

[18]  SALAH E. Elmaghraby,et al.  The two-machine stochastic flowshop problem with arbitrary processing time distributions , 1999 .

[19]  Liang Zhang,et al.  A class of hypothesis-test-based genetic algorithms for flow shop scheduling with stochastic processing time , 2005 .

[20]  M. H. van der Vlerk,et al.  Optimizing electricity distribution using two-stage integer recourse models , 2000 .

[21]  Dimitri Golenko-Ginzburg,et al.  Industrial job-shop scheduling with random operations and different priorities , 1995 .

[22]  Wu Zhi-ming Hybrid particle swarm optimization approach for multi-objective flexible job-shop scheduling problems , 2005 .

[23]  David P. Morton,et al.  Stochastic Vehicle Routing with Random Travel Times , 2003, Transp. Sci..

[24]  Víctor M. Albornoz,et al.  A two‐stage stochastic integer programming model for a thermal power system expansion , 2004 .

[25]  Stephen C. Graves,et al.  A Review of Production Scheduling , 1981, Oper. Res..

[26]  Marcos Singer,et al.  Forecasting policies for scheduling a stochastic due date job shop , 2000 .

[27]  Ignacio E. Grossmann,et al.  Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods , 2002 .

[28]  Pierre Borne,et al.  Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems , 2002, IEEE Trans. Syst. Man Cybern. Part C.

[29]  K Darby-Dowman,et al.  A two-stage stochastic programming with recourse model for determining robust planting plans in horticulture , 2000, J. Oper. Res. Soc..

[30]  Christian Schulz,et al.  Approximation of an ideal online scheduler for a multiproduct batch plant , 2000 .

[31]  Ramón Alvarez-Valdés,et al.  A heuristic to schedule flexible job-shop in a glass factory , 2005, Eur. J. Oper. Res..

[32]  Yeong-Dae Kim A comparison of dispatching rules for job shops with multiple identical jobs and alternative routeings , 1990 .

[33]  A. Guinet Multi-site planning: A transshipment problem , 2001 .

[34]  Nhu Binh Ho,et al.  GENACE: an efficient cultural algorithm for solving the flexible job-shop problem , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[35]  Toji Makino ON A SCHEDULING PROBLEM , 1965 .

[36]  Lale Özbakir,et al.  Using multiple objective tabu search and grammars to model and solve multi-objective flexible job shop scheduling problems , 2004, J. Intell. Manuf..

[37]  Gilbert Laporte,et al.  The integer L-shaped method for stochastic integer programs with complete recourse , 1993, Oper. Res. Lett..

[38]  Gülay Barbarosoglu,et al.  A two-stage stochastic programming framework for transportation planning in disaster response , 2004, J. Oper. Res. Soc..

[39]  Jerzy Kamburowski,et al.  On three-machine flow shops with random job processing times , 2000, Eur. J. Oper. Res..

[40]  Michael Pinedo,et al.  Minimizing the Expected Makespan in Stochastic Flow Shops , 1982, Oper. Res..

[41]  Stéphane Dauzère-Pérès,et al.  An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search , 1997, Ann. Oper. Res..

[42]  Deepu. Philip,et al.  Scheduling reentrant flexible job shops with sequence dependent setup times , 2005 .

[43]  C Riago TARDINESS MINIMIZATION IN A FLEXIBLE JOB SHOP: A TABU SEARCH APPROACH , 2004 .

[44]  Zuobao Wu,et al.  Multiagent scheduling method with earliness and tardiness objectives in flexible job shops , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[45]  Jim Hutchison,et al.  Scheduling approaches for random job shop flexible manufacturing systems , 1991 .

[46]  P P Talwar,et al.  A NOTE ON SEQUENCING PROBLEM WITH UNCERTAIN JOB TIMES , 1967 .

[47]  Dimitri Golenko-Ginzburg,et al.  Optimal job-shop scheduling with random operations and cost objectives , 2002 .

[48]  Ali Allahverdi,et al.  Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function , 1995 .

[49]  Ihsan Sabuncuoglu,et al.  Experimental investigation of iterative simulation-based scheduling in a dynamic and stochastic job shop , 2001 .

[50]  Jonathan Cole Smith,et al.  A stochastic integer programming approach to solving a synchronous optical network ring design problem , 2004, Networks.

[51]  Gideon Weiss,et al.  Multiserver Stochastic Scheduling , 1982 .

[52]  P C Bagga N-JOB, 2-MACHINE SEQUENCING PROBLEM WITH STOCHASTIC SERVICE TIMES , 1970 .

[53]  F. G. Forst Minimizing total expected costs in the two-machine, stochastic flow shop , 1983 .

[54]  Louis Cloutier,et al.  Computer-assisted multi-item, muti-machine and multi-site scheduling in a hardwood flooring factory , 1998 .

[55]  Chunfu Jia Minimizing variation in stochastic flow shop , 1998, Oper. Res. Lett..

[56]  D. Golenko-Ginzburg,et al.  Using “look ahead” techniques in job-shop scheduling with random operations , 1997 .

[57]  Zhi-Long Chen,et al.  Machine scheduling with transportation considerations , 2001 .

[58]  M. Morozowski,et al.  Transmission constrained maintenance scheduling of generating units: a stochastic programming approach , 1995 .

[59]  David Alcaide López de Pablo,et al.  An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns , 2002, Eur. J. Oper. Res..

[60]  S. Suresh,et al.  Stochastically minimizing the makespan in flow shops , 1984 .

[61]  Paolo Brandimarte,et al.  Routing and scheduling in a flexible job shop by tabu search , 1993, Ann. Oper. Res..

[62]  Gloria Pérez,et al.  An Approach for Strategic Supply Chain Planning under Uncertainty based on Stochastic 0-1 Programming , 2003, J. Glob. Optim..

[63]  Loo Hay Lee,et al.  A simulation study on release, synchronization, and dispatching in MEMS fabrication , 2002, Proceedings of the Winter Simulation Conference.

[64]  Ignacio E. Grossmann,et al.  Scheduling optimization under uncertainty - an alternative approach , 2003, Comput. Chem. Eng..

[65]  Zhi-Long Chen,et al.  A scenario-based stochastic programming approach for technology and capacity planning , 2002, Comput. Oper. Res..

[66]  Frank Werner,et al.  Mean flow time minimization with given bounds of processing times , 2004, Eur. J. Oper. Res..

[67]  Amir Azaron,et al.  A hybrid method for solving stochastic job shop scheduling problems , 2005, Appl. Math. Comput..

[68]  Andrew J. Schaefer,et al.  Locating Hybrid Fuel Cell–Turbine Power Generation Units under Uncertainty , 2004, Ann. Oper. Res..