1,284 research outputs found
An approach for the production scheduling problem when lot streaming is enabled at the operational level
By means of the present work, the production scheduling and the lot streaming problems are simultaneously addressed at flexible manufacturing environments. The proposal is based on a Constraint Programming (CP) formulation that can efficiently tackle the scheduling of manufacturing operations and the splitting of lots into smaller sublots. The approach is capable to define the number of sublots for each lot and the number of parts belonging to each sublot, as well as the assignment of the operations on sublots to machines, with their corresponding start and completion times. The CP model can be easily adapted to cope with different problem issues and several operational policies, which constitutes the main novelty of the contribution. A set of case studies were solved in order to validate the proposal and good quality solutions were found when minimizing the makespan.Sociedad Argentina de InformĂĄtica e InvestigaciĂłn Operativ
An approach for the production scheduling problem when lot streaming is enabled at the operational level
By means of the present work, the production scheduling and the lot streaming problems are simultaneously addressed at flexible manufacturing environments. The proposal is based on a Constraint Programming (CP) formulation that can efficiently tackle the scheduling of manufacturing operations and the splitting of lots into smaller sublots. The approach is capable to define the number of sublots for each lot and the number of parts belonging to each sublot, as well as the assignment of the operations on sublots to machines, with their corresponding start and completion times. The CP model can be easily adapted to cope with different problem issues and several operational policies, which constitutes the main novelty of the contribution. A set of case studies were solved in order to validate the proposal and good quality solutions were found when minimizing the makespan.Sociedad Argentina de InformĂĄtica e InvestigaciĂłn Operativ
An approach for the production scheduling problem when lot streaming is enabled at the operational level
By means of the present work, the production scheduling and the lot streaming problems are simultaneously addressed at flexible manufacturing environments. The proposal is based on a Constraint Programming (CP) formulation that can efficiently tackle the scheduling of manufacturing operations and the splitting of lots into smaller sublots. The approach is capable to define the number of sublots for each lot and the number of parts belonging to each sublot, as well as the assignment of the operations on sublots to machines, with their corresponding start and completion times. The CP model can be easily adapted to cope with different problem issues and several operational policies, which constitutes the main novelty of the contribution. A set of case studies were solved in order to validate the proposal and good quality solutions were found when minimizing the makespan.Sociedad Argentina de InformĂĄtica e InvestigaciĂłn Operativ
Scheduling with subcontracting options
Department of Logistics2008-2009 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe
High-Level Object Oriented Genetic Programming in Logistic Warehouse Optimization
DisertaÄnĂ prĂĄce je zamÄĹena na optimalizaci prĹŻbÄhu pracovnĂch operacĂ v logistickĂ˝ch skladech a distribuÄnĂch centrech. HlavnĂm cĂlem je optimalizovat procesy plĂĄnovĂĄnĂ, rozvrhovĂĄnĂ a odbavovĂĄnĂ. JelikoĹž jde o problĂŠm patĹĂcĂ do tĹĂdy sloĹžitosti NP-teĹžkĂ˝, je vĂ˝poÄetnÄ velmi nĂĄroÄnĂŠ nalĂŠzt optimĂĄlnĂ ĹeĹĄenĂ. MotivacĂ pro ĹeĹĄenĂ tĂŠto prĂĄce je vyplnÄnĂ pomyslnĂŠ mezery mezi metodami zkoumanĂ˝mi na vÄdeckĂŠ a akademickĂŠ pĹŻdÄ a metodami pouĹžĂvanĂ˝mi v produkÄnĂch komerÄnĂch prostĹedĂch. JĂĄdro optimalizaÄnĂho algoritmu je zaloĹženo na zĂĄkladÄ genetickĂŠho programovĂĄnĂ ĹĂzenĂŠho bezkontextovou gramatikou. HlavnĂm pĹĂnosem tĂŠto prĂĄce je a) navrhnout novĂ˝ optimalizaÄnĂ algoritmus, kterĂ˝ respektuje nĂĄsledujĂcĂ optimalizaÄnĂ podmĂnky: celkovĂ˝ Äas zpracovĂĄnĂ, vyuĹžitĂ zdrojĹŻ, a zahlcenĂ skladovĂ˝ch uliÄek, kterĂŠ mĹŻĹže nastat bÄhem zpracovĂĄnĂ ĂşkolĹŻ, b) analyzovat historickĂĄ data z provozu skladu a vyvinout sadu testovacĂch pĹĂkladĹŻ, kterĂŠ mohou slouĹžit jako referenÄnĂ vĂ˝sledky pro dalĹĄĂ vĂ˝zkum, a dĂĄle c) pokusit se pĹedÄit stanovenĂŠ referenÄnĂ vĂ˝sledky dosaĹženĂŠ kvalifikovanĂ˝m a trĂŠnovanĂ˝m operaÄnĂm manaĹžerem jednoho z nejvÄtĹĄĂch skladĹŻ ve stĹednĂ EvropÄ.This work is focused on the work-flow optimization in logistic warehouses and distribution centers. The main aim is to optimize process planning, scheduling, and dispatching. The problem is quite accented in recent years. The problem is of NP hard class of problems and where is very computationally demanding to find an optimal solution. The main motivation for solving this problem is to fill the gap between the new optimization methods developed by researchers in academic world and the methods used in business world. The core of the optimization algorithm is built on the genetic programming driven by the context-free grammar. The main contribution of the thesis is a) to propose a new optimization algorithm which respects the makespan, the utilization, and the congestions of aisles which may occur, b) to analyze historical operational data from warehouse and to develop the set of benchmarks which could serve as the reference baseline results for further research, and c) to try outperform the baseline results set by the skilled and trained operational manager of the one of the biggest warehouses in the middle Europe.
Lot sizing and furnace scheduling in small foundries
A lot sizing and scheduling problem prevalent in small market-driven foundries is studied. There are two related decision levels: (1) the furnace scheduling of metal alloy production, and (2) moulding machine planning which specifies the type and size of production lots. A mixed integer programming (MIP) formulation of the problem is proposed, but is impractical to solve in reasonable computing time for non-small instances. As a result, a faster relax-and-fix (RF) approach is developed that can also be used on a rolling horizon basis where only immediate-term schedules are implemented. As well as a MIP method to solve the basic RF approach, three variants of a local search method are also developed and tested using instances based on the literature. Finally, foundry-based tests with a real-order book resulted in a very substantial reduction of delivery delays and finished inventory, better use of capacity, and much faster schedule definition compared to the foundry's own practice. Š 2006 Elsevier Ltd. All rights reserved
Market-Based Task Allocation Mechanisms for Limited Capacity Suppliers
This paper reports on the design and comparison of two economically-inspired mechanisms for task allocation in environments where sellers have finite production capacities and a cost structure composed of a fixed overhead cost and a constant marginal cost. Such mechanisms are required when a system consists of multiple self-interested stakeholders that each possess private information that is relevant to solving a system-wide problem. Against this background, we first develop a computationally tractable centralised mechanism that finds the set of producers that have the lowest total cost in providing a certain demand (i.e. it is efficient). We achieve this by extending the standard Vickrey-Clarke-Groves mechanism to allow for multi-attribute bids and by introducing a novel penalty scheme such that producers are incentivised to truthfully report their capacities and their costs. Furthermore our extended mechanism is able to handle sellers' uncertainty about their production capacity and ensures that individual agents find it profitable to participate in the mechanism. However, since this first mechanism is centralised, we also develop a complementary decentralised mechanism based around the continuous double auction. Again because of the characteristics of our domain, we need to extend the standard form of this protocol by introducing a novel clearing rule based around an order book. With this modified protocol, we empirically demonstrate (with simple trading strategies) that the mechanism achieves high efficiency. In particular, despite this simplicity, the traders can still derive a profit from the market which makes our mechanism attractive since these results are a likely lower bound on their expected returns
Generalized Incremental Mechanisms for Scheduling Games
We study the problem of devising truthful mechanisms for cooperative cost sharing
games that realize (approximate) budget balance and social cost. Recent negative
results show that group-strategyproof mechanisms can only achieve very poor approximation
guarantees for several fundamental cost sharing games. Driven by these limitations,
we consider cost sharing mechanisms that realize the weaker notion of weak groupstrategyproofness.
Mehta et al. [Games and Economic Behavior, 67:125â155, 2009] recently
introduced the broad class of weakly group-strategyproof acyclic mechanisms and
show that several primal-dual approximation algorithms naturally give rise to such mechanisms
with attractive approximation guarantees. In this paper, we provide a simple yet
powerful approach that enables us to turn any r-approximation algorithm into a r-budget
balanced acyclic mechanism. We demonstrate the applicability of our approach by deriving
weakly group-strategyproof mechanisms for several fundamental scheduling problems
that outperform the best possible approximation guarantees of Moulin mechanisms.
The mechanisms that we develop for completion time scheduling problems are the first
mechanisms that achieve constant budget balance and social cost approximation factors.
Interestingly, our mechanisms belong to the class of generalized incremental mechanisms
proposed by Moulin [Social Choice and Welfare, 16:279â320, 1999]
Mixed integer programming formulations and heuristics for joint production and transportation problems.
In this thesis we consider different joint production and transportation problems. We first study the simplest two-level problem, the uncapacitated two-level production-in-series lot-sizing problem (2L-S/LS-U). We give a new polynomial dynamic programming algorithm and a new compact extended formulation for the problem and for an extension with sales. Some computational tests are performed comparing several reformulations on a NP-Hard problem containing the 2L-S/LS-U as a relaxation. We also investigate the one-warehouse multi-retailer problem (OWMR), another NP-Hard extension of the 2L-S/LS-U. We study possible ways to tackle the problem effectively using mixed integer programming (MIP) techniques. We analyze the projection of a multi-commodity reformulation onto the space of the original variables for two special cases and characterize valid inequalities for the 2L-S/LS-U. Limited computational experiments are performed to compare several approaches. We then analyze a more general two-level production and transportation problem with multiple production sites. Relaxations for the problem for which reformulations are known are identified in order to improve the linear relaxation bounds. We show that some uncapacitated instances of the basic problem of reasonable size can often be solved to optimality. We also show that a hybrid MIP heuristic based on two different MIP formulations permits us to find solutions guaranteed to be within 10% of optimality for harder instances with limited transportation capacity and/or with additional sales. For instances with big bucket production or aggregate storage capacity constraints the gaps can be larger. In addition, we study a different type of production and transportation problem in which cllients place orders with different sizes and delivery dates and the transportation is performed by a third company. We develop a MIP formulation and an algorithm with a local search procedure that allows us to solve large instances effectively.
- âŚ