Abstract
Consider the following scheduling problem: a set of jobs is to be processed without preemption on m identical machines. The jobs are partitioned into classes. Before jobs from a class can be processed on a machine, a setup is required, whose duration depends on the class. The objective is to schedule all jobs while minimizing the completion time of the last job, also known as the makespan. We present and analyze three polynomial algorithms for this problem. The first algorithm follows a next-fit strategy and has approximation ratioi¾ź3. The second is a very efficient algorithm with approximation ratio arbitrarily close toi¾ź2. The last algorithm is a polynomial time approximation scheme.
Published Version
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