Multi-level job scheduling in a flexible job shop environment

This study deals with a scheduling problem with multi-level job structures in a flexible job shop environment. This scheduling process arises after the part production plans are created by the MRP (material requirement planning) system, therefore the total tardiness measure is considered as an objec...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of production research Ročník 52; číslo 13; s. 3877 - 3887
Hlavní autoři: Na, Hongbum, Park, Jinwoo
Médium: Journal Article
Jazyk:angličtina
Vydáno: London Taylor & Francis 03.07.2014
Taylor & Francis LLC
Témata:
flexible job shop
genetic algorithm
Genetic algorithms
Integer programming
Job shop scheduling
Job shops
Linear programming
Material requirements planning
Materials requirement planning
Mathematical analysis
Mathematical models
Mixed integer
multi-level job structure
Production scheduling
Scheduling
Searching
Studies
ISSN:0020-7543, 1366-588X
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í:This study deals with a scheduling problem with multi-level job structures in a flexible job shop environment. This scheduling process arises after the part production plans are created by the MRP (material requirement planning) system, therefore the total tardiness measure is considered as an objective function in order to complete the parts by the set due dates. MILP (mixed integer linear programming) model is introduced to mathematically represent the target problem. Owing to the high complexity of the target problem, GA (genetic algorithm) is proposed to solve the problem and additional methods, such as priority rules and local search rules, are applied to improve the performance of GA. Computational examples are shown and the results are discussed in comparison with the results of IBM ILOG CPLEX and IBM ILOG CP Optimizer.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0020-7543
1366-588X
DOI:10.1080/00207543.2013.848487