Capacitated Lot Sizing Problem
Mostrando 1-8 de 8 artigos, teses e dissertações.
-
1. CAPACITATED LOT SIZING AND SCHEDULING WITH ORDER ACCEPTANCE AND DELIVERY TIME WINDOWS: MATHEMATICAL MODEL AND A MIP-BASED HEURISTIC
ABSTRACT This research addresses a lot sizing and scheduling problem inspired by a real-world production environment where the customers make advanced orders and the industry need to decide which orders will be accepted with the aim of maximizing the profit respecting the production capacity constraints. Orders are composed of different types of items which
Pesqui. Oper.. Publicado em: 02/12/2019
-
2. STOCHASTIC DISCRETE LOT-SIZING WITH LEAD TIMES FOR FUEL SUPPLY OPTIMIZATION
ABSTRACT We address the problem of expected cost minimization of meeting the uncertain fuel demand during a time planning horizon, where supply is provided by selecting discrete shipments with lead times. Due to uncertainty and the passage of time, corrective actions can be taken such as cancellation and postponement on supply of shipments with associated co
Pesqui. Oper.. Publicado em: 09/05/2019
-
3. A New Branching Rule to Solve the Capacitated Lot Sizing and Scheduling Problem with Sequence Dependent Setups
RESUMO Neste artigo tratamos do desafiador problema integrado de dimensionamento de lotes e sequenciamento da produção na existência de tempos e custos de preparação para produção dependentes da sequência. Mais especificamente, nossa atenção é fixada no modelo CLSD, proposto em(13). Propõe-se, neste trabalho, uma reformulação para o modelo CLSD
TEMA (São Carlos). Publicado em: 2017-12
-
4. MATHEMATICAL MODELLING AND SOLUTION APPROACHES FOR PRODUCTION PLANNING IN A CHEMICAL INDUSTRY
ABSTRACT This paper addresses a lot sizing problem in a Brazilian chemical industry where a product can be produced by more than one process, which can use different parallel machines and may even consume a wide range of raw materials. Moreover, most of the products are liquids and the inventories must be kept in a restricted number of storage tanks with a l
Pesqui. Oper.. Publicado em: 2017-08
-
5. Geração de colunas para o problema de dimensionamento de lotes de produção com limitações de capacidade / Column generation heuristics for capacitated lotsizing problem
The Capacitated Lot Sizing Problem (CLSP) consists in determining a production plan such that all demands are met and the total costs of production, inventory and setup are minimized. Since the problem to find a feasible solution to the CLSP with setup times is NP-complete, large problem instances have been solved by heuristic methods. In this dissertation,
Publicado em: 2009
-
6. A hybrid heuristic for the multi-plant capacitated lot sizing problem with setup carry-over
This paper addresses the capacitated lot sizing problem (CLSP) with a single stage composed of multiple plants, items and periods with setup carry-over among the periods. The CLSP is well studied and many heuristics have been proposed to solve it. Nevertheless, few researches explored the multi-plant capacitated lot sizing problem (MPCLSP), which means that
Journal of the Brazilian Computer Society. Publicado em: 2008-12
-
7. Abordagens para o problema integrado de dimensionamento e sequenciamento de lotes da produção de bebidas.
The object of this study is the integrated problem of lot sizing and scheduling of the soft drink production. Such problem consists of deciding how much to produce of each drink and in each period and in which sequence, in order to satisfy the demand and to minimize the costs of storage, backlogging and changeover. The set up times of the machines are sequen
Publicado em: 2006
-
8. Planejamento da produção em maquinas paralelas sob restrições de capacidade
The well known capacitated lot sizing problem has been studied intensively in the last years and it consists of the determination of a production plan which satisfies a known demand and defines how much to produce of each item in each period of a planning horizon. This work explores a model where the items can be produced by any of the multiple non-identical
Publicado em: 1993