Abstract
In this study we consider the single machine scheduling problems with sum-of-logarithm-processing-times based deterioration, i.e., the actual job processing time is a function of the sum of the logarithm of the processing times of the jobs already processed. We show that even with the introduction of the sum-of-logarithm-processing-times based deterioration to job processing times, single machine makespan minimization problem remain polynomially solvable. But for the total completion time minimization problem, we show that the optimal schedule is not always V-shaped with respect to job normal processing times. Heuristic algorithms and computational results are presented for the total completion time minimization problem.
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.
