Research on Scheduling of Jobs with Bottleneck of Stretch in Plane Manufacturing

摘要

This paper proposed a heuristic algorithm based on due-dates for a stretch machine scheduling problem in the plane manufacturing industry. Factory-specified due-dates for jobs, oven capacity, stretch machine availability, and setting times were incorporated into an Integer-Programming model. To uarantee the due-dates of different orders, maximizing the efficiency of bottleneck resource (i.e., stretch machine in this paper) must be considered. Then, the problem was translated into an analysis on minimizing the make-span of all jobs on stretch machine by scheduling. Because of the computational complexity of the problem, we developed a heuristic approach. Computational experience indicates that the heuristic gives high quality solutions with significant savings in time over standard IP algorithms.