نتایج جستجو برای: job shop systems
تعداد نتایج: 1252757 فیلتر نتایج به سال:
Tendency to optimization in last decades has resulted in creating multi-product manufacturing systems. Production planning in such systems is difficult, because optimal production volume that is calculated must be consistent with limitation of production system. Hence, integration has been proposed to decide about these problems concurrently. Main problem in integration is how we can relate pro...
The general job-shop scheduling problem is known to be extremely hard. We describe a GA approach which produces reasonably good results very quickly on standard benchmark job-shop scheduling problems, better than previous eeorts using genetic algorithms for this task, and comparable to existing conventional search-based methods. The representation used is a variant of one known to work moderate...
The general job-shop scheduling problem is known to be extremely hard. We describe a GA approach which produces reasonably good results very quickly on standard benchmark job-shop scheduling problems, better than previous eeorts using genetic algorithms for this task, and comparable to existing conventional search-based methods. The representation used is a variant of one known to work moderate...
This paper presents and evaluates an order release decision rule in a job-shop, based on the input-output control concept. The order release mechanism is part of a global decision-making scheme that includes four main decisions: accept/reject orders, define the order’s due date, release the accepted jobs and dispatch it on the shop floor. This paper also presents an evaluation of two acceptance...
The n×m minimum-makespan general job-shop scheduling problem, hereafter referred to as the JSSP, can be described by a set of n jobs {Ji}1≤j≤n which is to be processed on a set of m machines {Mr}1≤r≤m. Each job has a technological sequence of machines to be processed. The processing of job Jj on machine Mr is called the operation Ojr. Operation Ojr requires the exclusive use of Mr for an uninte...
The job shop problem is an important part of scheduling in the manufacturing industry. A new intelligent algorithm named Shuffled Complex Evolution (SCE) algorithm is proposed in this paper with the aim of getting the minimized makespan. The sequence mapping mechanism is used to change the variables in the continuous domain to discrete variables in the combinational optimization problem; the se...
Smaller production companies, such as job shops, are often incapable of committing significant human or capital resources for the improvement of manufacturing flow times. However, there is considerable demand in these organizations for solutions that offer improvements without the risk involved in expending these resources. This paper investigates the impact of scheduling rules and reorganizati...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید