70,886 research outputs found

    Stochastic multi-period multi-product multi-objective Aggregate Production Planning model in multi-echelon supply chain

    Get PDF
    In this paper a multi-period multi-product multi-objective aggregate production planning (APP) model is proposed for an uncertain multi-echelon supply chain considering financial risk, customer satisfaction, and human resource training. Three conflictive objective functions and several sets of real constraints are considered concurrently in the proposed APP model. Some parameters of the proposed model are assumed to be uncertain and handled through a two-stage stochastic programming (TSSP) approach. The proposed TSSP is solved using three multi-objective solution procedures, i.e., the goal attainment technique, the modified ε-constraint method, and STEM method. The whole procedure is applied in an automotive resin and oil supply chain as a real case study wherein the efficacy and applicability of the proposed approaches are illustrated in comparison with existing experimental production planning method

    Production/maintenance cooperative scheduling using multi-agents and fuzzy logic

    Get PDF
    Within companies, production is directly concerned with the manufacturing schedule, but other services like sales, maintenance, purchasing or workforce management should also have an influence on this schedule. These services often have together a hierarchical relationship, i.e. the leading function (most of the time sales or production) generates constraints defining the framework within which the other functions have to satisfy their own objectives. We show how the multi-agent paradigm, often used in scheduling for its ability to distribute decision-making, can also provide a framework for making several functions cooperate in the schedule performance. Production and maintenance have been chosen as an example: having common resources (the machines), their activities are actually often conflicting. We show how to use a fuzzy logic in order to model the temporal degrees of freedom of the two functions, and show that this approach may allow one to obtain a schedule that provides a better compromise between the satisfaction of the respective objectives of the two functions

    A Personalized System for Conversational Recommendations

    Full text link
    Searching for and making decisions about information is becoming increasingly difficult as the amount of information and number of choices increases. Recommendation systems help users find items of interest of a particular type, such as movies or restaurants, but are still somewhat awkward to use. Our solution is to take advantage of the complementary strengths of personalized recommendation systems and dialogue systems, creating personalized aides. We present a system -- the Adaptive Place Advisor -- that treats item selection as an interactive, conversational process, with the program inquiring about item attributes and the user responding. Individual, long-term user preferences are unobtrusively obtained in the course of normal recommendation dialogues and used to direct future conversations with the same user. We present a novel user model that influences both item search and the questions asked during a conversation. We demonstrate the effectiveness of our system in significantly reducing the time and number of interactions required to find a satisfactory item, as compared to a control group of users interacting with a non-adaptive version of the system

    A reusable iterative optimization software library to solve combinatorial problems with approximate reasoning

    Get PDF
    Real world combinatorial optimization problems such as scheduling are typically too complex to solve with exact methods. Additionally, the problems often have to observe vaguely specified constraints of different importance, the available data may be uncertain, and compromises between antagonistic criteria may be necessary. We present a combination of approximate reasoning based constraints and iterative optimization based heuristics that help to model and solve such problems in a framework of C++ software libraries called StarFLIP++. While initially developed to schedule continuous caster units in steel plants, we present in this paper results from reusing the library components in a shift scheduling system for the workforce of an industrial production plant.Comment: 33 pages, 9 figures; for a project overview see http://www.dbai.tuwien.ac.at/proj/StarFLIP
    corecore