Title: Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine
Abstract: We consider scheduling problems with learning/deterioration effects and time-dependent processing times on a single machine, with or without due date assignment considerations. By reducing them to a special assignment problem on product matrices, we solve all these problems in near-linear time. This improves the time complexity of previous algorithms for some scheduling problems and establishes the fast polynomial solvability for several other problems.
Publication Year: 2012
Publication Date: 2012-09-14
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 31
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot