Abstract

The paper deals with a single machine scheduling problem with start time dependent job processing times. The problem is to find a schedule for which the total weighted completion time is minimized. It is proved that the problem is ordinary NP-hard, if the processing time of one additional job is given by decreasing linear function dependent on its start time. Based on the optimal properties found for some special cases of the general problem, three heuristic algorithms have been constructed and experimentally compared.

Full Text
Published version (Free)

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