Parallel line job shop scheduling using genetic algorithm

Parallel line job shop scheduling involves the optimal allocation and scheduling of jobs in multiple processing lines. Each job is allocated to a particular line and is processed to completion in that line. Also, all jobs allocated to a line are processed in a particular order. The objective of this...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of advanced manufacturing technology Ročník 35; číslo 9-10; s. 1047 - 1052
Hlavní autoři: Noorul Haq, A., Balasubramanian, K., Sashidharan, B., Karthick, R. B.
Médium: Journal Article
Jazyk:angličtina
Vydáno: London Springer-Verlag 01.01.2008
Springer Nature B.V
Témata:
CAE) and Design
Computer-Aided Engineering (CAD
Engineering
Genetic algorithms
Industrial and Production Engineering
Job shop scheduling
Job shops
Mechanical Engineering
Media Management
Optimization
Optimization techniques
Original Article
Production scheduling
Schedules
Makespan minimization
Parallel line scheduling
Genetic algorithm
Job-shop scheduling
ISSN:0268-3768, 1433-3015
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Parallel line job shop scheduling involves the optimal allocation and scheduling of jobs in multiple processing lines. Each job is allocated to a particular line and is processed to completion in that line. Also, all jobs allocated to a line are processed in a particular order. The objective of this paper is to find the optimal allocation of jobs to lines and also the optimal order of jobs processed in each line based on individual processing times and set up times. The optimal schedule gives the minimum makespan for the completion of all jobs. The optimization technique used is genetic algorithm.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0268-3768
1433-3015
DOI:10.1007/s00170-007-1164-z