نتایج جستجو برای: objective dynamic job shop modjs

تعداد نتایج: 1018095  

Journal: :DEStech Transactions on Computer Science and Engineering 2018

Journal: :IEEE Access 2021

In recent years, people have paid more and attention to traditional manufacturing's environmental impact, especially in terms of energy consumption related emissions carbon dioxide. Except for adopting new equipment, production scheduling could play an important role reducing the total a manufacturing plant. Machine tools waste considerable amount because their underutilization. Consequently, s...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه صنعتی اصفهان 1379

زمانبندی تخصیص منابع در طول زمان برای اجرای مجموعه ای از وظایف است . مساله تک ماشین عبارت است از زمانبندی n کار روی یک ماشین، طوریکه هر کار i در زمان معین ai جهت اجرا روی ماشین آماده می باشد، به این معنی که تا قبل از زمان ai قابل دسترسی نیست و همچنین به اندازه di زمان لازم است تا آن کار انجام گیرد. از طرفی پس از اتمام کار i روی ماشین به اندازه qi زمان لازم است تا کار مربوطه تمام شده تلقی گردد. ...

Journal: :European Journal of Operational Research 2010
L. De Giovanni Ferdinando Pezzella

The Distributed and Flexible Job-shop Scheduling problem (DFJS) considers the scheduling of distributed manufacturing environments, where jobs are processed by a system of several Flexible Manufacturing Units (FMUs). Distributed scheduling problems deal with the assignment of jobs to FMUs and with determining the scheduling of each FMU, in terms of assignment of each job operation to one of the...

2011
Liping Zhang Xinyu Li Liang Gao Yang Yang Ping Jiang

In most real production environment, schedules are usually inevitable with the presence of a variety of unexpected disruptions. Thus it is necessary to develop predictive/reactive schedules which can absorb disruptions while maintaining high shop performance. In this paper, a robust predictive/reactive scheduling method is developed for solving job shop scheduling in dynamic environment. It con...

In this paper the problem of job shop scheduling with parallel machines in each stages is discussed. The objective is to minimize the maximum completion time (makespan).This problem is a combination of two classic problems of job shop and parallel machines which in this case parallel machines has been used as kind of flexibility in the job shop problem. The review of literature has shown that t...

2007
V. Vinod R. Sridharan

This paper presents the salient aspects of a simulation-based experimental study of scheduling rules for scheduling a dynamic job shop in which the setup times are sequence dependent. A discrete event simulation model of the job shop system is developed for the purpose of experimentation. Seven scheduling rules from the literature are incorporated in the simulation model. Five new setup-oriente...

2010
Kanate Ploydanai Anan Mungwattana

Typically, general job shop scheduling problems assume that working times of machines are equal, for instance eight hours a day. However, in real factories, these working times are different because the machines may have different processing speeds, or they may require maintenance. That is, one machine may need to be operated only half day whereas other machines may have to be operated for the ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید