Solving a real job shop scheduling problem

• Type: Article in International Conference Proceedings Book
• Date: 2009

Authors

Avila Rondon, RL (Author) Other; Adriano Carvalho (Author) FEUP

Conference proceedings International

Title: IECON: 2009 35TH ANNUAL CONFERENCE OF IEEE INDUSTRIAL ELECTRONICS, VOLS 1-6

Pages: 2494-2498

35th Annual Conference of the IEEE-Industrial-Electronics-Society (IECON 2009)

Porto, PORTUGAL, NOV 03-05, 2009

Indexing

Scopus - 0 Citations

Other information

Authenticus ID: P-007-T3R

DOI: 10.1109/iecon.2009.5415226

Abstract (EN): This work deals with a real job shop scheduling problem (jssp). The operations sequences, processing time, setup time, deadline time, due date time, priority, machine, fabric color and related technological decisions data are obtained from orders database along with a set of technological criteria about machines, which allows automatically analyzing and generating the initial scheduling sequences. These sequences are processed later by two procedures, one based on Ant Colony, and the other in Genetic Algorithms. Both procedures are integrated to a generative scheduling method and dispatching rules for big problems. In this approach is integrated technological information from: the process planning and scheduling process, in order to improve the processing time and the solution quality. ©2009 IEEE.

Language: English

Type (Professor's evaluation): Scientific