نتایج جستجو برای: dynamic job shop
تعداد نتایج: 480643 فیلتر نتایج به سال:
Reactive scheduling is often been criticized for its inability to provide timely optimized and stable schedules. So far, the extant literature has focused on generating schedules that optimize shop floor efficiency. Only a few have considered optimizing both shop floor efficiency and schedule stability. This paper applies a unique selfadaptation mechanism of the ant colony optimization (ACO) al...
Inventory plays a major role in deciding the overall manufacturing costs, and a good scheduling system should balance the on-time delivery of products versus low work-in-process (WIP) inventory. In this paper, the “CONstant Work-In-Process” (CONWIP) concept is applied to job shop scheduling to effectively control WIP inventory. A new mathematical formulation of CONWIP-based job shop schedulin...
Job shop scheduling(JSS) is a hard problem with most of the research focused on scenarios with the assumption that the shop parameters such as processing times, due dates are constant. But in the real world uncertainty in such parameters is a major issue. In this work, we investigate a genetic programming based hyper-heuristic approach to evolving dispatching rules suitable for dynamic job shop...
The objective of this paper is to study a selected set of scheduling criteria commonly used in scheduling research and develop a set of simple rules that can be easily implemented in relatively small dynamic job-shops. Simulation models were developed for two dynamic production shop environments, namely, a job-shop with jumbled flow and a job-shop with limited jumbled flow. Five scheduling crit...
زمانبندی تخصیص منابع در طول زمان برای اجرای مجموعه ای از وظایف است . مساله تک ماشین عبارت است از زمانبندی n کار روی یک ماشین، طوریکه هر کار i در زمان معین ai جهت اجرا روی ماشین آماده می باشد، به این معنی که تا قبل از زمان ai قابل دسترسی نیست و همچنین به اندازه di زمان لازم است تا آن کار انجام گیرد. از طرفی پس از اتمام کار i روی ماشین به اندازه qi زمان لازم است تا کار مربوطه تمام شده تلقی گردد. ...
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...
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...
This paper addresses the application of AI techniques in a practical OR problem , i.e. scheduling. Scheduling is a scientific domain concerning the allocation of tasks to a limited set of resources over time. The goal of scheduling is to maximize (or minimize) different optimization criteria such as the makespan (i.e. the completion time of the last operation in the schedule), the occupation ra...
This paper addresses the job shop scheduling problem in the presence of machine breakdowns. In this work, we propose to exploit the advantages of data mining techniques to resolve the problem. We proposed an approach to discover a set of classification rules by using historic scheduling data. Intelligent decisions are then made in real time based on this constructed rules to assign the correspo...
In the classical job shop scheduling problem (JSSP), n jobs are processed to completion on m unrelated machines. Each job requires processing on each machine exactly once. For each job, technology constraints specify a complete, distinct routing which is fixed and known in advance. Processing times are sequence-independent, fixed, and known in advance. Each machine is continuously available fro...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید