نتایج جستجو برای: flexible job shop scheduling problem fjsp
تعداد نتایج: 1086441 فیلتر نتایج به سال:
We consider a three-stage dynamic flexible flow shop scheduling problem in which jobs of multiple types arrive dynamically over time, a quality feedback mechanism is present, and the setup timing and the process defect rate are closely related. At each machine in the second stage, a sequence-independent setup operation is necessary to changeover job types. Once a setup is done for a job type at...
Material handling tasks in the job shops have to be coordinated with manufacturing operations in order to efficiently utilize the production resources and to reduce the accumulation of work-in-process inventory. This paper extends the traditional job shop scheduling problem by incorporating the scheduling of the material handling tasks. It provides a generic definition and a network model for t...
Green manufacturing has become a new production mode for the development and operation of modern future industries. The flexible job shop scheduling problem (FJSP), as one key core problems in field green process planning, hot topic difficult issue research. In this paper, an improved multi-objective wolf pack algorithm (MOWPA) is proposed solving with transportation constraints. Firstly, model...
Abstract In order to solve the problems such as poor diversity and convergence ability of offspring population NSGA-II Algorithm in vehicle production scheduling problem, an improved shop algorithm based on is proposed. The NSGA-ii mainly focuses crossover mutation traditional Algorithm, proposes a new self-adaptive Crossover operator. By comparing individual crowding degree with average popula...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید