Abstract
ABSTRACT This article studies a single-machine scheduling problem with DeJong's effect and a machine availability constraint taking the total completion time as the objective function. Firstly, a fully polynomial-time approximation scheme (FPTAS) was given for the problem, and afterwards that FPTAS was extended for the single-machine scheduling problem with deteriorating jobs, DeJong's learning effect and a machine availability constraint.
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.
