CO-JSS-BEE-GA - 5/6/11 EXAMININGTHE PERFORMANCEOFBEE...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
Asıl alt başlık stilini düzenlemek için tıklatın 5/6/11 EXAMINING THE  PERFORMANCE OF BEE  COLONY OPTIMIZATION AND  Instructor: Assist. Prof. Serol Bulkan Prepared  by: Gunes Demir Eseoğlu                          Combinatorial Optimization  
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
5/6/11 Description of Job Shop  Scheduling A finite set of n jobs Each job consists of a chain of operations  A finite set of m machines Each machine can handle at most one operation  at a time Each operation needs to be processed during an  uninterrupted period of a given length on a given  machine Purpose is to find a schedule, that is, an 
Background image of page 2
5/6/11 Formal Definition of JSS Job set Machine set Operations    Each operation has processing time  On O define A, a binary relation represent a  precedence between operations. If                   then v 
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/07/2011 for the course INDUSTRIAL IE 208 taught by Professor Serolbulkan during the Fall '11 term at Marmara Üniversitesi.

Page1 / 10

CO-JSS-BEE-GA - 5/6/11 EXAMININGTHE PERFORMANCEOFBEE...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online