2008
DOI: 10.1007/s10845-008-0113-5
|View full text |Cite
|
Sign up to set email alerts
|

Bi-objective optimization algorithms for joint production and maintenance scheduling: application to the parallel machine problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
71
0
1

Year Published

2012
2012
2021
2021

Publication Types

Select...
3
3
3

Relationship

0
9

Authors

Journals

citations
Cited by 127 publications
(72 citation statements)
references
References 20 publications
0
71
0
1
Order By: Relevance
“…Liao and Sheen [35] considered parallel machine scheduling with availability and eligibility constraints simultaneously. Berrichi et al [36] studied parallel machines focusing on make span and unavailability simultaneously. Zribi et al [37] integrated job-shop scheduling problem with availability constraints.…”
Section: -1 Integration Of Maintenance and General Production Problemsmentioning
confidence: 99%
“…Liao and Sheen [35] considered parallel machine scheduling with availability and eligibility constraints simultaneously. Berrichi et al [36] studied parallel machines focusing on make span and unavailability simultaneously. Zribi et al [37] integrated job-shop scheduling problem with availability constraints.…”
Section: -1 Integration Of Maintenance and General Production Problemsmentioning
confidence: 99%
“…Berrichi et al [21] used evolutionary genetic algorithms to minimize makespan and system unavailability while scheduling n jobs on m machines. The Pareto front thus obtained is approximated to obtain the desired optimized schedules.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In their study, the jobs are scheduled using Ant System algorithm [120] and then the insertion of maintenance tasks is done by using several heuristics, taking the production scheduling as a hard constraint. Berrichi et al [121] used genetic algorithm to find the optimal allocation and sequencing of the jobs in a parallel machine environment and determined the best PM decisions based on that job schedule.…”
Section: Sequential Schedulingmentioning
confidence: 99%