Abstract
During the production process, regular maintenance is necessary and important to maintain high efficiency, because machines inevitably fail with increasing use. However, certain tasks are often neglected due to time and budget constraints, and other factors. In this regard, we propose the unrelated parallel-machine scheduling problem with maintenance and rejection penalties, wherein the ultimate objective is to minimize total cost while identifying the optimal maintenance frequencies, optimal maintenance positions, set of rejected jobs, and optimal scheduled job sequence. Considering resource constraints, the maintenance cost is controlled by the upper bound of the total maintenance frequency. Based on these factors, the optimal polynomial-time solution and its computational complexity with a fixed number of machines are presented. As an illustrative example, it was determined that the scheduling method proposed in this report is effective and practical.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.