Abstract
We consider a problem where the planning decisions of producing on and maintaining a single machine are integrated. The age of the machine, and thus when maintenance should be performed, is influenced by the production decisions. Decisions are taken on a planning horizon discretized in periods. The computational complexity of several variants of the single-item problem are studied depending on whether (i) Maintenance can be performed on the machine at any point in time in a period or must be performed at the end of a period, (ii) There is a fixed aging component when starting production, and (iii) There is a minimum age before maintenance can be performed on the machine. The multi-item case is proved to be NP-hard.
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 callDisclaimer: 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.
