We propose a class of decisive collective choice rules that rely on linear ordering to partition the majority relation into two acyclic relations. The first these relations is used pare down set feasible alternatives shortlist while second make final from shortlist. Rules in this are characterized by four properties: classical rationality requirements (Sen's Expansion Consistency and Manzini Ma...

Abstract System-wide optimization of distributed manufacturing operations enables process improvement beyond the standalone and individual optimality norms. This study addresses production planning a system consisting three stages: parts (subcomponents), assembly components in Original Equipment Manufacturer (OEM) factories, final products at product manufacturer’s factory. Distributed Three St...

Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...

We describe a two phase algorithm for MAX{SAT and weighted MAX{ SAT problems. In the rst phase, we use the GSAT heuristic to nd a good solution to the problem. In the second phase, we use an enumera-tion procedure based on the Davis{Putnam{Loveland algorithm, to nd a provably optimal solution. The rst heuristic stage improves the performance of the algorithm by obtaining an upper bound on the m...

We consider a two-stage serial inventory system whose cost structure exhibits economies of scale in both stages. In the system, stage 1 faces Poisson demand and replenishes its inventory from stage 2, and the latter stage in turn orders from an outside supplier with unlimited stock. Each shipment, either to stage 2 or to stage 1, incurs a fixed setup cost. We derive important properties for a g...