|
|
 |
| |
|
|
|
Research on Scheduling of Jobs in Plane Manufacturing |
|
|
|
PP: 1047-1053 |
|
|
|
Author(s) |
|
|
|
Yanqing Qiu,
Peng Ge,
Peiyu Ren,
Maozhu Jin,
Yuyan Luo,
Huafeng Gao,
|
|
|
|
Abstract |
|
|
| This paper proposed a heuristic algorithm based on due-dates for a stretch machine scheduling problem in the plane manufacturing industry. An integer-Programming model incorporated the due-dates of jobs,capacity of oven, availability of stretch machines, and setting up times is built. The objective of this problem was to minimize the make-span of all jobs on stretch machines by scheduling. To guarantee the due-dates of different orders, maximizing the efficiency of bottleneck resource (i.e., stretch machine in this paper) must be considered. Because of the computational complexity of this problem, this paper developed a heuristic approach. Computational experiences indicated that the heuristic gave high quality solutions with significant savings in time over standard IP algorithms |
|
|
|
|
|
|
|
