2010
DOI: 10.1007/s00170-010-2666-7
|View full text |Cite
|
Sign up to set email alerts
|

Minimizing the makespan and the system unavailability in parallel machine scheduling problem: a similarity-based genetic algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 24 publications
(7 citation statements)
references
References 22 publications
0
7
0
Order By: Relevance
“…A multi-objective ant colony optimization approach is proposed. Moradi and Zandieh [28] introduced a similarity-based subpopulation genetic algorithm (SBSPGA) to solve the same problem. The performance of the algorithm is compared with those of two other evolutionary algorithms.…”
Section: Literature Reviewmentioning
confidence: 99%
“…A multi-objective ant colony optimization approach is proposed. Moradi and Zandieh [28] introduced a similarity-based subpopulation genetic algorithm (SBSPGA) to solve the same problem. The performance of the algorithm is compared with those of two other evolutionary algorithms.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Recently, Moradi et al [44] investigates an integrated flexible job shop problem with preventive maintenance where the reliability approach was applied for modeling maintenance aspects of problem where both the maintenance activity numbers and maintenance intervals are not fixed in advance. The same approach is presented for the parallel machine scheduling case by Moradi and Zandieh [43]. Furthermore, Ben Ali et al [10] developed an elitist multi-objective genetic algorithm and derived some lower bounds providing a set of Pareto optimal solutions to minimize the makespan and the total maintenance cost in a job shop environment.…”
Section: Joint Production and Maintenance Schedulingmentioning
confidence: 86%
“…Moradi and Zandieh (2010) [13] investigated the make span and the system unavailability problem and presented a genetic algorithm for the problem. The necessary and sufficient conditions of optimality of a solution which was obtained in flowshop ISP (Brucker, P. and Shakhlevich, N.V., 2011) [14].…”
Section: Brief Review Of Inverse Scheduling Problemmentioning
confidence: 99%