Abstract

In this paper, we consider the two-parallel machine scheduling problem with a non-availability interval. We aim to minimize the maximum lateness when every job has a positive tail. We show that the problem has a constant polynomial approximation algorithm. We present a dynamic programming algorithm and we show that the problem has an FPTAS (Fully Polynomial Time Approximation Algorithm). The proposed FPTAS has a strongly polynomial running time. Finally, we present some numerical experiments and we analyze the obtained results.

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 call

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.