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

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

Journal: :Oper. Res. Lett. 1997
S. T. Webster

Family scheduling problems are characterized by a setup time structure where setups are only required between jobs from different families. We consider the problem of scheduling job families on parallel machines to minimize weighted deviation about a common due date. Various special cases of this problem have been considered in the literature. This note summarizes known complexity results and i...

Journal: :J. Economic Theory 2016
Volker Benndorf Ismael Martínez-Martínez Hans-Theo Normann

Standard oneand two-population models for evolutionary games are the limit cases of a uniparametric family combining intraand intergroup interactions. Our setup interpolates between both extremes with a coupling parameter κ. For the example of the hawk-dove game, we analyze the replicator dynamics of the coupled model. We confirm the existence of a bifurcation in the dynamics of the system and ...

Journal: :journal of industrial engineering, international 2006
rasoul haji alireza haji

this paper deals with the single machine multi-product lot scheduling problem in which defective items are produced in any production run of each product. we have adopted the common cycle scheduling policy and assumed that the setup times for production of each product can be non-zero. further, we have assumed that defective items will be reworked and the inspection costs during the normal prod...

2005
Mariko Sakashita Kazuhisa Makino Satoru Fujishige

Let V be a finite set with |V | = n. A family F ⊆ 2 is called laminar if for all two sets X, Y ∈ F , X ∩ Y 6= ∅ implies X ⊆ Y or X ⊇ Y . Given a laminar family F , a demand function d : F → R+, and a monotone concave cost function F : RV+ → R+, we consider the problem of finding a minimum-cost x ∈ RV+ such that x(X) ≥ d(X) for all X ∈ F . Here we do not assume that the cost function F is differ...

Aref Maleki-Darounkolaei Iman Seyyedi Mahmoud Modiri Reza Tavakkoli-Moghaddam

This paper considers a three-stage assembly flowshop scheduling problem with sequence-dependent setup < /div> times at the first stage and blocking times between each stage in such a way that the weighted mean completion time and makespan are minimized. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time using traditiona...

Journal: :European Journal of Operational Research 2007
Subhashish Samaddar Craig A. Hill

Earlier research has found that the presence of setup time variance can cause an adverse effect on waiting time and inventory as one reduces setup time for a product on a single machine that processes a number of products in a cyclic production system [Sarkar, D., Zangwill, W.I., 1991. Variance effects in cyclic production systems. Management Science 37 (4) 444–453; Zangwill, W.I., 1987. From E...

2007
Cynthia Kuo Jesse Walker Adrian Perrig

Bluetooth Simple Pairing and Wi-Fi Protected Setup specify mechanisms for exchanging authentication credentials in wireless networks. Both Simple Pairing and Protected Setup support multiple setup mechanisms, which increases security risks and hurts the user experience. To improve the security and usability of these specifications, we suggest defining a common baseline for hardware features and...

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

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