نتایج جستجو برای: objective dynamic job shop modjs
تعداد نتایج: 1018095 فیلتر نتایج به سال:
The purpose of this study is to develop an effective scheduling methodology for a realistic flow shop sequencing problem. The flow shop consists of two machines where only the first machine has separable, external, and sequence dependent setup times. The length of setup times required for a job depends not on the immediately preceding job but on the job which is two steps prior to it. The probl...
Flexible job shop scheduling problem, is an extension of the classical job shop scheduling problem. In Flexible job shop scheduling problem, there are more than one machine with the same features for the same purpose. The problem can be defined as appointing the jobs to the machines (assignment) and ordering the jobs at each machine (sequencing) to serve the desired purpose. Multi-objective fle...
Rapid development of the Internet of Things not only provides large amounts of data to the job-shop scheduling, but also proposes a great challenge for dynamic job shop scheduling. A dynamic job shop scheduling approach is proposed based on the data-driven genetic algorithm. Application examples suggest that this approach is correct, feasible and available. This approach can provide the technic...
In this paper, Multi-Objective Flexible Job-Shop scheduling with Parallel Machines in Dynamic manufacturing environment (MO-FDJSPM) is investigated. Moreover considering dynamical job-shop environment (jobs arrived in non-zero time), It contains two kinds of flexibility which is effective for improving operational manufacturing systems. The non-flexibility leads to scheduling program which have...
摘要 現場管制系統是ERP的主要子系統之一, 其主要功能是安排現場訂單的排程. 根據研 究,大部分現場的排程問題是屬於 Job Shop問 題. 所以過去幾十年來 Job Shop問題一直是 產業界與學術界重要的研究課題之一. 其間 雖有無數的論文發表, 但因缺少考慮現場實際 的狀況, 很少研究的成果可以用來解決現場的 排程問題. 本研究開發以 Tabu Search為主的 排程方法. 經以個人在美國工作現場所使用之 MRP II 系統所產生的資料驗證, 本方法確能 有效求解現場的排程問題. 關鍵字: Job Shop, Tabu Search Abstract Shop floor control system is a sub-system of the ERP system. Its major function is to generate daily schedules f...
A data mining based approach to discover previously unknown priority dispatching rules for job shop scheduling problem is presented. This approach is based upon seeking the knowledge that is assumed to be embedded in the efficient solutions provided by the optimization module built using tabu search. The objective is to discover the scheduling concepts using data mining and hence to obtain a ru...
In a shop floor of the industry, the routings which are based upon the jobs that need to be processed on different machines are one among the major activities and therefore the resource requirements are not based upon the quantity as in a flow shop but rather the routings for the products being produced. However, both job shop and flow shop production cope with a scheduling problem to find a fe...
Job shop scheduling is one of the most explored areas in the last few decades. Although it is very commonly witnessed in real-life situations, very less investigation has been carried out in scheduling operations of multi-level jobs, which undergo serial, parallel, and assembly operations in an assembly job shop. In this work, some of the dispatch rules, which have best performances in scheduli...
Go-shop provisions have changed the way in which private equity firms execute public-company buyouts. While there has been considerable practitioner commentary on go-shops in the three years since they first appeared, this paper presents the first systematic empirical evidence on this new dealmaking technology. Contrary to the claims of prior commentators, I find that: (1) goshops yield more se...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید