| The speed development of the market economy leads to increased competition, this isn’tjust about the human, finance and technology competition between enterprises. In addition,we should make use of the advanced managing and productive technology to combine thescarce resources, and the most important problem which enterprises face is to form an optimalmanagement and manufacturing models today. Especially for the production-orientedenterprises, how to reduce production costs has direct influences on its competitiveness in themarket. This is the significance of this paper. Scheduling is an important combinatorialoptimization problem, the modern scheduling problem breaks through the various hypothesisof classical problems, so the practical application background is broader. Modern enterpriseproduction activities are becoming more flexible under the impetus of the market demand,more and more scholars pay close attention to group technology scheduling problems due tothe actual production activities such as order type, volume and modular production.The second chapter discusses the single machine scheduling group problems withdeteriorating jobs and without ready time, which the processing time of a job in the group is asimple linear function of its starting time, and the setup time of a group is also a simple linearfunction of its starting setup time. For the weighted sum of the k power of job completiontimes minimization problem, and the weighted sum of the k power of job waiting timesminimization problem, we present the polynomial time optimal algorithm, respectively. Thethird chapter considers the single machine scheduling group problems with ready time anddeteriorating jobs, which the processing time of a job in the group is a proportional linearfunction of its starting time, and the setup time of a group is a constant. For some specialcases, the minimization of makespan problem can be solved in polynomial time. For thegeneral case, a polynomial time heuristic algorithm is proposed. |
PDF Full Text Request