Machine scheduling is a common problem found in many manufacturing and service industry. In this study, the stated problem is imitated from real-world beverage industry. We consider integrated problem of workforce allocation and parallel machine scheduling with sequence-dependent setup time and machine eligibility restrictions. Due to complexity of the problem, a rule-based heuristic is occurred to arrange production schedules in practice. Though this heuristic could make planner arrange the schedule effortlessly, much time is wasted on unnecessary setup which causes the completion time of all job fall behind what it is supposed to be. To overcome this circumstance, the problem is formulated into mathematical model with the aim to minimize makespan.  Based on the result of the experiment, it can be concluded that the proposed model could obtain more effective result than those of the existing rule-based heuristic and LPT significantly.