This paper considers a scheduling problem with two identical parallel machines. One has unlimited capacity; the other can only run for a fixed time. A given set of jobs must be scheduled on the two machines with the goal of minimizing the sum of their completion times. The paper proposes an...

This paper considers a real-life identical parallel scheduling problem originating from the manufacturing plant producing polyvinyl chloride leather products. In the considered scheduling problem, each job has some attributes and each attribute has several different levels. Because there is at...