An Application Service Provider Approach For Hybrid Evolutionary Algorithm-based Real-world Flexible Job Shop Scheduling Problem

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@InProceedings{Tanev:2002:gecco,

• author = "Ivan T. Tanev and Takashi Uozumi and Yoshiharu Morotome",
• title = "An Application Service Provider Approach For Hybrid Evolutionary Algorithm-based Real-world Flexible Job Shop Scheduling Problem",
• booktitle = "GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference",
• editor = "W. B. Langdon and E. Cant{\'u}-Paz and K. Mathias and R. Roy and D. Davis and R. Poli and K. Balakrishnan and V. Honavar and G. Rudolph and J. Wegener and L. Bull and M. A. Potter and A. C. Schultz and J. F. Miller and E. Burke and N. Jonoska",
• year = "2002",
• pages = "1219--1226",
• address = "New York",
• publisher_address = "San Francisco, CA 94104, USA",
• month = "9-13 " # jul,
• publisher = "Morgan Kaufmann Publishers",
• keywords = "genetic algorithms, genetic programming, real world applications, application service, evolutionary algorithm, job shop scheduling, provider",
• ISBN = "1-55860-878-8",
• URL = "http://gpbib.cs.ucl.ac.uk/gecco2002/RWA307.pdf",
• URL = "http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/gecco2002/gecco-2002-20.pdf",
• abstract = "scheduling of customers' orders in factories of plastic injection machines (FPIM) as a case of real-world flexible job shop scheduling problem (FJSS). The objective of discussed work is to provide FPIM with high business speed which implies (a) providing a customers with convenient way for remote online access to the factory's database and (b) developing an efficient scheduling routine for planning the assignment of the submitted customers' orders to FPIM machines. Remote online access to FPIM database, approached via delivering the software as a Web-service in accordance with the application service provider (ASP) paradigm is proposed. As an approach addressing the issue of efficient scheduling routine a hybrid evolutionary algorithm (HEA) combining priority-dispatching rules (PDRs) with GA, is developed. An implementation of HEA as a database stored procedure is discussed. Performance evaluation results are presented. The results obtained for evolving a schedule of 400 customers' orders on experimental model of FPIM indicate that the business delays in order of half an hour can be achieved.",
• notes = "GECCO-2002. A joint meeting of the eleventh International Conference on Genetic Algorithms (ICGA-2002) and the seventh Annual Genetic Programming Conference (GP-2002)",

}

Genetic Programming entries for Ivan T Tanev Takashi Uozumi Yoshiharu Morotome

Citations