نتایج جستجو برای: family setup time

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

R . Uthayakumar S. Priyan

This paper investigates the issue of an economic manufacturing quantity model for defective products involving imperfect production processes and rework. We consider that the demand is sensitive to promotional efforts/sales teams’ initiatives as well as the setup cost can be reduced through further investment. It also assumes that fixed quantity multiple installments of the finished batch are d...

To increase the production efficiency of a typical turbine blade, it is necessary to change its material and hence its production technology. In this respect and in order to make sure that newmat...

2006
Dmitry Gorodetsky Philip Wilsey

As society places greater demands on technology, it becomes increasingly important to be able to simulate that technology. While simulation tools can be very sophisticated and capable of handling very complex devices and structures, the cost paid in computation time can be prohibitive. To reduce this time, a number of one-step schemes have been developed, but these schemes suffer from a setup t...

2011
S. Y. Wan T. N. Wong Sicheng Zhang Luping Zhang

This paper presents an ant colony optimization (ACO) approach in solving integrated process planning and scheduling (IPPS) with the consideration of setup time. Lots of approaches are proposed to solve the IPPS problem. Most of these approaches ignored the consideration of setup time in order to simplify the problem. This practice may be justifiable for some situations. However, it is not pract...

Journal: :Physical review letters 2008
Witlef Wieczorek Christian Schmid Nikolai Kiesel Reinhold Pohlner Otfried Gühne Harald Weinfurter

A single linear-optical setup is used to observe an entire family of four-photon entangled states. This approach breaks with the inflexibility of present linear-optical setups usually designed for the observation of a particular multipartite entangled state only. The family includes several prominent entangled states that are known to be highly relevant for quantum information applications.

D. Gupta, S. Bala, S. Sharma,

One of the earliest results in flow shop scheduling theory is an algorithm given by Johnson’s [1] for scheduling jobs on two or three machines to minimize the total elapsed time whenever the processing times of jobs are random. The present paper is an attempt to develop a heuristic algorithm for two stages specially structured flow shop scheduling in which the processing times of the jobs a...

Production scheduling is one of the very important problems that industry and production are confronted with it. Production scheduling is often planned in the industrial environments while productivity in production can improve significantly the expansion of simultaneous optimization of the scheduling plan. Production scheduling and production are two areas that have attracted much attention in...

2012
Mohamed. K. Omar Siew C. Teo

Competitions and ever-changing customer requirements are the driven forces behind manufacturers to reevaluate their planning and scheduling methods and manufacturing systems. Customers’ satisfaction in most cases can be measured by the ability of the manufacturing firms to provide goods with reasonably good prices, acceptable quality standard and deliver at the right time. Scheduling plays an i...

2001
Ali Allahverdi Tariq Aldowaisan Yuri N. Sotskov

The two-machine permutation flowshop scheduling problem to minimize makespan or total completion time criterion is addressed where setup times are considered to be separate from processing times. Setup times are relaxed to be random variables as opposed to the common assumption in the literature that setup times are exactly known (deterministic) in advance. The probability distributions of setu...

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

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