Minimizing makespan in a group shop with fuzzy release dates and processing times

This paper deals with a fuzzy group shop scheduling problem. The group shop scheduling problem is a general formulation that includes the flow shop, the job shop, and the open shop scheduling problems. Job release dates and processing times are considered to be triangular fuzzy numbers. The objectiv...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of advanced manufacturing technology Ročník 66; číslo 9-12; s. 2063 - 2074
Hlavní autoři: Ahmadizar, Fardin, Zarei, Alireza
Médium: Journal Article
Jazyk:angličtina
Vydáno: London Springer-Verlag 01.06.2013
Springer Nature B.V
Témata:
CAE) and Design
Completion time
Computer-Aided Engineering (CAD
Engineering
Genetic algorithms
Industrial and Production Engineering
Integer programming
Job shop scheduling
Job shops
Linear programming
Mechanical Engineering
Media Management
Original Article
Production scheduling
Release dates
Schedules
Chance-constrained programming
Makespan
Fuzzy processing times
Group shops scheduling
Genetic algorithm
Fuzzy release dates
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í:This paper deals with a fuzzy group shop scheduling problem. The group shop scheduling problem is a general formulation that includes the flow shop, the job shop, and the open shop scheduling problems. Job release dates and processing times are considered to be triangular fuzzy numbers. The objective is to find a job schedule that minimizes the maximum completion time or makespan. First, the problem is formulated in a form of fuzzy programming and then prepared in a form of deterministic mixed binary integer linear programming by applying the chance-constrained programming. To solve the problem, an efficient genetic algorithm hybridized with an improvement procedure is developed. Both Lamarckian and Baldwinian versions are then implemented and evaluated through computational experiments.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0268-3768
1433-3015
DOI:10.1007/s00170-012-4482-8