Abstract
This paper addresses the problem of identifying a profit-maximizing schedule for jobs in a just-in-time production line, where the decision maker can adjust each job’s processing time, and thereby its quality level and the profit that can be gained from it. The system comprises two sequential machines with a transition period between them and a setup time after completion of each job on the second machine. We first construct an exact algorithm that maximizes the profit. Since this problem is NP-hard, we construct a fully polynomial time approximation scheme (FPTAS) to address it and evaluate its computational complexity.
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.
