355
Views
50
CrossRef citations to date
0
Altmetric
Original Articles

Using genetic algorithms (GA) and a coloured timed Petri net (CTPN) for modelling the optimization-based schedule generator of a generic production scheduling system

&
Pages 1763-1789 | Received 01 Sep 2005, Published online: 09 Mar 2007

References

  • Baker , KR . 1974 . Introduction to Sequencing and Scheduling , New York : Wiley .
  • Bautista , J , Lusa , A , Suarez , R , Mateo , M , Pastor , R and Corominas , A . 1999 . Application of genetic algorithms to assembly sequence planning with limited resources . Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning . 1999 . pp. 411 – 416 .
  • Chen , C , Vempati , V and Aljaber , N . 1995 . An application of genetic algorithms for flow shop problems . Eur. J. Oper. Res. , 80 : 389 – 396 .
  • Chen , JH , Fu , LC , Lin , MH and Huang , AC . 2001 . Petri-net and GA-based approach to modeling, scheduling, and performance evaluation for wafer fabrication . IEEE Trans. Robot. Automat. , 17 : 619 – 636 .
  • Chen , TR and Hsia , TC . 1994 . Job shop scheduling with multiple resources and an application to a semiconductor testing facility . Proceedings on the 33rd Conference on Decision and Control . 1994 . pp. 1564 – 1570 .
  • Chien , C-F , Chang , K and Chen , C . 2003 . Design of sampling strategy for measuring and compensating overlay errors in semiconductor manufacturing . Int. J. Prod. Res. , 41 : 2547 – 2561 .
  • Chien , C-F and Wu , J . 2003 . Analyzing repair decisions in the site imbalance problem of semiconductor test machines . IEEE Trans. Semiconduct. Manuf. , 16 : 704 – 711 .
  • Dillenberger , C , Escudero , LF , Wollensak , A and Zhang , W . 1994 . On practical resource allocation for production planning and scheduling with period overlapping set-ups . Eur. J. Oper. Res. , 75 : 275 – 286 .
  • Dorndorf , U and Pesch , E . 1995 . Evolution based learning in a job shop scheduling environment . Comput. Oper. Res. , 22 : 25 – 40 .
  • Evans , JB . 1988 . Structures of Discrete Event Simulation: An Introduction to the Engagement Strategy , Chichester : Ellis Horwood .
  • Evans , JB . 1993 . The Devnet: a Petri net for discrete event simulation . Lect. Note. Comput. Sci.: Adv. Petri Nets 1993 , 674 : 91 – 125 .
  • Garey , MR and Johnson , DS . 1979 . Computers and Intractability: A Guide to the Theory of NP-Completeness , Murray Hill, NJ : Bell Laboratories .
  • Gen , M and Cheng , R . 1997 . Genetic Algorithms and Engineering Design , New York : Wiley .
  • Ghedjati , F . 1999 . Genetic algorithms for the job-shop scheduling problem with unrelated parallel constraints: heuristic mixing method machines and precedence . Comput. Ind. Eng. , 37 : 39 – 42 .
  • Hui , CW and Gupta , A . 2000 . A novel MILP formulation for short-term scheduling of multistage multi-product batch plants . Comput. Chem. Eng. , 24 : 1611 – 1617 .
  • Jain , V , Swarnkar , R and Tiwari , MK . 2003 . Modeling and analysis of wafer fabrication scheduling via generalized stochastic Petri net and simulated annealing . Int. J. Prod. Res. , 41 : 3501 – 3527 .
  • Jeng , MD , Xie , XL and Chou , SW . 1998 . Modeling, qualitative analysis, and performance evaluation of the etching area in an IC wafer fabrication system using Petri nets . IEEE Trans. Semiconduct. Manuf. , 11 : 358 – 373 .
  • Leachman , RC and Hodges , DA . 1996 . Benchmarking semiconductor manufacturing . IEEE Trans. Semiconduct. Manuf. , 9 : 158 – 169 .
  • Lin , JT and Lee , CC . 1996 . Three-phase discrete event simulation of timed Petri nets . J. Chin. Instit. Ind. Eng. , 13 : 11 – 22 .
  • Lin , SY and Huang , HP . 1998 . Modeling and emulation of a furnace in IC fab based on colored-timed Petri net . IEEE Trans. Semiconduct. Manuf. , 11 : 410 – 420 .
  • Liu , J and MacCarthy , BL . 1997 . A global MILP model for FMS scheduling . Eur. J. Oper. Res. , 100 : 441 – 453 .
  • Mendez , CA , Henning , GP and Cerda , J . 2001 . An MILP continuous-time approach to short-term scheduling of resource-constrained multistage flowshop batch facilities . Comput. Chem. Eng. , 25 : 701 – 711 .
  • Odrey , NG , Green , JD and Appello , A . 2001 . A generalized Petri net modeling approach for the control of re-entrant flow semiconductor wafer fabrication . Robot. Comput.-Integr. Manuf. , 17 : 5 – 11 .
  • Pearn , WL , Chung , SH and Yang , MH . 2002 . Minimizing the total machine workload for the wafer probing scheduling problem . IIE Trans. , 34 : 211 – 220 .
  • Piersma , N and Dijk , WV . 1996 . A local search heuristic for unrelated parallel machine-scheduling with efficient neighborhood search . Math. Comput. Model. , 24 : 1 – 19 .
  • Reeves , C . 1995 . A genetic algorithm for flow shop sequencing . Comput. Oper. Res. , 22 : 5 – 13 .
  • Sipser , M . 1997 . Introduction to the Theory of Computation , Boston, MA : PWS .
  • Uzsoy , R , Lee , C-Y and Martin-Vega , LA . 1992 . A review of production planning and scheduling models in the semiconductor industry. Part I: System characteristics, performance evaluation and production planning . IIE Trans. , 24 : 47 – 60 .
  • Wein , LM . 1988 . Scheduling semiconductor wafer fabrication . IEEE Trans. Semiconduct. Manuf. , 1 : 115 – 126 .
  • Xiong , HH and Zhou , MC . 1998 . Scheduling of semiconductor test facility via Petri nets and hybrid heuristic search . IEEE Trans. Semiconduct. Manuf. , 11 : 384 – 393 .
  • Yang , WH and Liao , CJ . 1999 . Survey of scheduling research involving set-up times . Int. J. Sys. Sci. , 30 : 143 – 155 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.