An additional stage for a Low Voltage Lazzaro’s Winner Take All (WTA) circuit is introduced. It allows lowering the voltage supply requirements so that it can be functional in fine line CMOS technology. Electrical measurements of a prototype in CMOS 0.5μm technology verify the operation of the WTA circuit with VDD = 1.5V. Simulations in PSpice and stability issues are presented as well.

The gap between willingness-to-pay (WTP) and willingness-to-accept (WTA) benefit values typifies situations in which reference points—and direction of movement from reference points—are consequential. Why WTA-WTP discrepancies arise is not well understood. We generalize models of reference dependence to identify separate reference dependence effects for increases and decreases in environmental ...

This paper considers the Economic Lot Scheduling Problem, that is, the problem of scheduling several products on a single facility so as to minimize holding and setup costs. Combination of frequency and timing as well as production quantity make this problem Np-hard. A heuristic is developed to obtain a good solution to ELSP. The proposed heuristic makes use of the Simulated Annealing Technique...

the aim of this paper is to study a multi-product, multi-period production systems in a hybrid flow shop so that lot-sizing and scheduling will be detemined simultaneously. a new mixed-integer programming model is proposed to formulate the studied problem. the objective function in this investigation includes the total cost of production, inventory and external supply. in the case of not satisf...

This paper considers the Economic Lot Scheduling Problem, that is, the problem of scheduling several products on a single facility so as to minimize holding and setup costs. Combination of frequency and timing as well as production quantity make this problem Np-hard. A heuristic is developed to obtain a good solution to ELSP. The proposed heuristic makes use of the Simulated Annealing Technique...

in static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. in this paper, the static scheduling problem of automated guided vehicles in container terminal is solved by the network simplex algorithm (nsa). the algorithm is based on graph model and their performances are at least 100 times faster than traditional si...

this paper presents a mathematical model for a flow shop scheduling problem consisting of m machine and n jobs with fuzzy processing times that can be estimated as independent stochastic or fuzzy numbers. in the traditional flow shop scheduling problem, the typical objective is to minimize the makespan). however,, two significant criteria for each schedule in stochastic models are: expectable m...