The Research Of Earliness/Tardiness With Time Cost On Whole-set Orders |
| Posted on:2009-03-12 | Degree:Master | Type:Thesis |
| Country:China | Candidate:Z X Li | Full Text:PDF |
| GTID:2189360278463595 | Subject:Management Science and Engineering |
| Abstract/Summary: | PDF Full Text Request |
| With the due time limits of orders or jobs, how to schedule the production of jobs to maximize the demand of customer is always being the hot problem in the research field of production operation. This paper proposes production scheduling and Earliness/Tardiness model based on the whole set orders.This paper will first introduce the research background and significance on the whole set orders problem. And the Earliness/Tardiness is given new explanation in the situation of the whole set orders. The paper considers Earliness/Tardiness with time cost on whole set orders in Single Machine and Flow-shop respectively. A hierarchy scheduling paradigm was introduced. The models maximizing the Weighted Number of whole set orders is established for the step 1. Discrete Particle Swarm Optimization and Genetic Algorithm are used to solve these models and prove the efficiency of the two algorithms by using numeric examples. In the step 2, the E/T with time cost models are established on the optimal scheduling from step 1 to adjust the rush time and lower the sum of time cost and delay penalty. Particle Swarm Optimization with some simple improvement is designed to solve these models. The variation trend of total penalty in different relative relations between time cost and delay penalty is found in numeric examples simulation. The conclusion found in Flow-shop is similar to the conclusion in Single Machine. |
| Keywords/Search Tags: | whole set orders, Earliness/Tardiness, hierarchy scheduling, time cost, PSO |
PDF Full Text Request |
Related items |