Abstract
A parallel-machine scheduling problem with preventive maintenance is studied in the paper. Because of the existence of indeterminacy phenomenon, the processing and maintenance time are assume to be uncertain variables. To address these uncertain parameters, two pessimistic value mathematical programming models are developed and the equivalence is proved. The worst-case bound of longest processing time (LPT) rule for the problem under an uncertain environment is obtained. To solve this problem effectively, an improved LPT rule is proposed according to the result of the theoretical analysis. Finally, numerical experiments show that the improved LPT outperforms the LPT in improving the quality of the optimal value and has a less relative error than that of the LPT.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Ambient Intelligence and Humanized Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
