Solving two production scheduling problems with sequence-dependent set-up times

In today’s competitive markets, the importance of goodscheduling strategies in manufacturing companies lead to theneed of developing efficient methods to solve complexscheduling problems.In this paper, we studied two production scheduling problemswith sequence-dependent setups times. The setup times areone of the most common complications in scheduling problems,and are usually associated with cleaning operations andchanging tools and shapes in machines.The first problem considered is a single-machine schedulingwith release dates, sequence-dependent setup times anddelivery times. The performance measure is the maximumlateness.The second problem is a job-shop scheduling problem withsequence-dependent setup times where the objective is tominimize the makespan.We present several priority dispatching rules for bothproblems, followed by a study of their performance. Finally,conclusions and directions of future research are presented.

Unfolding a symmetric matrix

Graphical displays which show inter--sample distances are importantfor the interpretation and presentation of multivariate data. Except whenthe displays are two--dimensional, however, they are often difficult tovisualize as a whole. A device, based on multidimensional unfolding, isdescribed for presenting some intrinsically high--dimensional displays infewer, usually two, dimensions. This goal is achieved by representing eachsample by a pair of points, say $R_i$ and $r_i$, so that a theoreticaldistance between the $i$-th and $j$-th samples is represented twice, onceby the distance between $R_i$ and $r_j$ and once by the distance between$R_j$ and $r_i$. Self--distances between $R_i$ and $r_i$ need not be zero.The mathematical conditions for unfolding to exhibit symmetry are established.Algorithms for finding approximate fits, not constrained to be symmetric,are discussed and some examples are given.

C3-symmetric peptide scaffolds are functional mimetics of trimeric CD40L.

Interaction between CD40, a member of the tumor necrosis factor receptor (TNFR) superfamily, and its ligand CD40L, a 39-kDa glycoprotein, is essential for the development of humoral and cellular immune responses. Selective blockade or activation of this pathway provides the ground for the development of new treatments against immunologically based diseases and malignancies. Like other members of the TNF superfamily, CD40L monomers self-assemble around a threefold symmetry axis to form noncovalent homotrimers that can each bind three receptor molecules. Here, we report on the structure-based design of small synthetic molecules with C3 symmetry that can mimic CD40L homotrimers. These molecules interact with CD40, compete with the binding of CD40L to CD40, and reproduce, to a certain extent, the functional properties of the much larger homotrimeric soluble CD40L. Architectures based on rigid C3-symmetric cores may thus represent a general approach to mimicking homotrimers of the TNF superfamily.

Forced diuresis improves the diagnostic accuracy of 18F-FDG PET in abdominopelvic malignancies.

Our aim was to evaluate the role of forced diuresis in improving the diagnostic accuracy of abdominopelvic (18)F-FDG PET. METHODS: Thirty-two patients were enrolled. Besides the presence of known intravesical tumors or undefined renal lesions on the initial PET scan, the inclusion criterion was the appearance of indeterminate or equivocal (18)F-FDG foci that extended along the course of the urinary tract and could not confidently be separated from urinary activity. For each patient, a second abdominopelvic PET study was performed after intravenous injection of 0.5 mg of furosemide per kilogram of body weight (maximum, 40 mg) coupled with parenteral infusion of physiologic saline. RESULTS: Forced diuresis coupled with parenteral hydration eliminated any significant (18)F-FDG activity from the lower urinary tract in 31 (97%) of 32 patients after the bladder had been voided 3 successive times. Twelve intravesical lesions were visualized with outstanding clarity, whereas radiologic suspicion of locally recurrent bladder tumors was ruled out in 3 patients. Among 14 indeterminate or equivocal extravesical foci, 7 were deemed of no clinical value because they disappeared after furosemide challenge, whereas 7 persisting foci were proven to be true-positive PET findings. The performance of (18)F-FDG PET in characterizing 3 renal-space-occupying lesions could not be improved by our protocol. CONCLUSION: Furosemide challenge has the potential to noninvasively resolve the inherent (18)F-FDG contrast handicap in the lower urinary tract.

New ideas need new space

We develop a setting with weak intellectual property rights, where firms' boundaries, location and knowledge spillovers are endogenous. We have two main results. The first one is that, if communication costs increase with distance, entrepreneurs concerned about information leakage have a benefit from locating away from the industry center: distance is an obstacle to collusive trades between members andnon-members. The second result is that we identify a trade-off for the entrepreneur between owning a facility (controlling all its characteristics) and sharing a facility with a {\it non-member} (an agent not involved in production), therefore losing control over some of its characteristics. We focus on ``location" as the relevant characteristic of the facility, but location can be used as a spatial metaphor for other relevant characteristics of the facility. For theentrepreneur, sharing the facility with non-members implies that the latter, as co-owners, know the location (even if they do not have access to it). Knowledge of the location for the co-owners facilitates collusion with employees, what increases leakage. The model yields a benefit for new plants from spatial dispersion (locating at the periphery of the industry), particularly so for new plants of new firms.We relate this result with recent empirical findings on the dynamics of industry location.

A dynamic choice model of hybrid behavior in the attribute-space

This paper presents a dynamic choice model in the attributespace considering rational consumers that discount the future. In lightof the evidence of several state-dependence patterns, the model isfurther extended by considering a utility function that allows for thedifferent types of behavior described in the literature: pure inertia,pure variety seeking and hybrid. The model presents a stationaryconsumption pattern that can be inertial, where the consumer only buysone product, or a variety-seeking one, where the consumer buys severalproducts simultane-ously. Under the inverted-U marginal utilityassumption, the consumer behaves inertial among the existing brands forseveral periods, and eventually, once the stationary levels areapproached, the consumer turns to a variety-seeking behavior. An empiricalanalysis is run using a scanner database for fabric softener andsignificant evidence of hybrid behavior for most attributes is found,which supports the functional form considered in the theory.

Hybrid consumption paths in the attribute space: A model and application with scanner data

This paper presents and estimates a dynamic choice model in the attribute space considering rational consumers. In light of the evidence of several state-dependence patterns, the standard attribute-based model is extended by considering a general utility function where pure inertia and pure variety-seeking behaviors can be explained in the model as particular linear cases. The dynamics of the model are fully characterized by standard dynamic programming techniques. The model presents a stationary consumption pattern that can be inertial, where the consumer only buys one product, or a variety-seeking one, where the consumer shifts among varied products.We run some simulations to analyze the consumption paths out of the steady state. Underthe hybrid utility assumption, the consumer behaves inertially among the unfamiliar brandsfor several periods, eventually switching to a variety-seeking behavior when the stationary levels are approached. An empirical analysis is run using scanner databases for three different product categories: fabric softener, saltine cracker, and catsup. Non-linear specifications provide the best fit of the data, as hybrid functional forms are found in all the product categories for most attributes and segments. These results reveal the statistical superiority of the non-linear structure and confirm the gradual trend to seek variety as the level of familiarity with the purchased items increases.

Proton T1 relaxation times of metabolites in human occipital white and gray matter at 7 T.

Proton T1 relaxation times of metabolites in the human brain have not previously been published at 7 T. In this study, T1 values of CH3 and CH2 group of N-acetylaspartate and total creatine as well as nine other brain metabolites were measured in occipital white matter and gray matter at 7 T using an inversion-recovery technique combined with a newly implemented semi-adiabatic spin-echo full-intensity acquired localized spectroscopy sequence (echo time = 12 ms). The mean T1 values of metabolites in occipital white matter and gray matter ranged from 0.9 to 2.2 s. Among them, the T1 of glutathione, scyllo-inositol, taurine, phosphorylethanolamine, and N-acetylaspartylglutamate were determined for the first time in the human brain. Significant differences in T1 between white matter and gray matter were found for water (-28%), total choline (-14%), N-acetylaspartylglutamate (-29%), N-acetylaspartate (+4%), and glutamate (+8%). An increasing trend in T1 was observed when compared with previously reported values of N-acetylaspartate (CH3 ), total creatine (CH3 ), and total choline at 3 T. However, for N-acetylaspartate (CH3 ), total creatine, and total choline, no substantial differences compared to previously reported values at 9.4 T were discernible. The T1 values reported here will be useful for the quantification of metabolites and signal-to-noise optimization in human brain at 7 T. Magn Reson Med 69:931-936, 2013. © 2012 Wiley Periodicals, Inc.

Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part I, the single-station case

We address the performance optimization problem in a single-stationmulticlass queueing network with changeover times by means of theachievable region approach. This approach seeks to obtainperformance bounds and scheduling policies from the solution of amathematical program over a relaxation of the system's performanceregion. Relaxed formulations (including linear, convex, nonconvexand positive semidefinite constraints) of this region are developedby formulating equilibrium relations satisfied by the system, withthe help of Palm calculus. Our contributions include: (1) newconstraints formulating equilibrium relations on server dynamics;(2) a flow conservation interpretation of the constraintspreviously derived by the potential function method; (3) newpositive semidefinite constraints; (4) new work decomposition lawsfor single-station multiclass queueing networks, which yield newconvex constraints; (5) a unified buffer occupancy method ofperformance analysis obtained from the constraints; (6) heuristicscheduling policies from the solution of the relaxations.

Sign of the Times, January 2008

Newsletter produced by Deaf Services Commission of Iowa

Sign of the Times, February 2008

Newsletter produced by Deaf Services Commission of Iowa

Sign of the Times, March 2008

Newsletter produced by Deaf Services Commission of Iowa