A branch and bound algorithm for single-machine production scheduling integrated with preventive maintenance planning

This paper deals with an integrated optimisation model for production scheduling and preventive maintenance (PM) in a single machine with its time to failure subject to a Weibull probability distribution. The objective is to minimise the total expected weighted completion time of jobs. To solve this...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of production research Ročník 51; číslo 3; s. 847 - 868
Hlavní autoři: Wang, Shijin, Liu, Ming
Médium: Journal Article
Jazyk:angličtina
Vydáno: London Taylor & Francis Group 01.02.2013
Taylor & Francis LLC
Témata:
Algorithms
Branch & bound algorithms
branch and bound algorithm
Completion time
Computation
Dominance
Mathematical problems
Operations research
Optimization
Preventive maintenance
Production scheduling
single machine
Studies
Upper bounds
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 paper deals with an integrated optimisation model for production scheduling and preventive maintenance (PM) in a single machine with its time to failure subject to a Weibull probability distribution. The objective is to minimise the total expected weighted completion time of jobs. To solve this problem, we develop a branch and bound (B&B) algorithm (hereafter called the B&BA). Several lower bounds, dominance rules and upper bounds are developed to enhance the performance of the B&BA. Extensive computational experiments on randomly generated problems with different configurations are conducted and the results show that the proposed method can find optimal solutions for problems with up to 18 jobs in a reasonable amount of computation time.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0020-7543
1366-588X
DOI:10.1080/00207543.2012.676683