Relevant bibliographies by topics / Capacitated Lot Sizing Problem

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Capacitated Lot Sizing Problem'

Author: Grafiati
Published: 4 June 2021
Last updated: 7 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Capacitated Lot Sizing Problem.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Capacitated Lot Sizing Problem"

1

Zhang, Minjiao. "Capacitated lot-sizing problem with outsourcing." Operations Research Letters 43, no. 5 (September 2015): 479–83. http://dx.doi.org/10.1016/j.orl.2015.06.007.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Suerie, Christopher, and Hartmut Stadtler. "The Capacitated Lot-Sizing Problem with Linked Lot Sizes." Management Science 49, no. 8 (August 2003): 1039–54. http://dx.doi.org/10.1287/mnsc.49.8.1039.16406.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Sharma, Renduchintala Raghavendra Kumar, Priyank Sinha, and Mananjay Kumar Verma. "Computationally Efficient Problem Reformulations for Capacitated Lot Sizing Problem." American Journal of Operations Research 08, no. 04 (2018): 312–22. http://dx.doi.org/10.4236/ajor.2018.84018.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Billington, Peter J. "The Capacitated Multi-Item Dynamic Lot-Sizing Problem." IIE Transactions 18, no. 2 (June 1986): 217–19. http://dx.doi.org/10.1080/07408178608975350.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Patil, Amitkumar, Gaurav Kumar Badhotiya, Bimal Nepal, and Gunjan Soni. "Modeling Multi-Plant Capacitated Lot Sizing Problem with Interplant Transfer." International Journal of Mathematical, Engineering and Management Sciences 6, no. 3 (June 1, 2021): 961–74. http://dx.doi.org/10.33889/ijmems.2021.6.3.057.

Full text
Abstract:
Lot sizing models involve operational and tactical decisions. These decisions may entail multi-level production processes such as assembly operations with multiple plants and limited capacities. Lot sizing problems are widely recognized as NP-hard problems therefore difficult to solve, especially the ones with multiple plants and capacity constraints. The level of complexity rises to an even higher level when there is an interplant transfer between the plants. This paper presents a Genetic Algorithm (GA) based solution methodology applied to large scale multi-plant capacitated lot sizing problem with interplant transfer (MPCLSP-IT). Although the GA has been a very effective and widely accepted meta-heuristic approach used to solve large scale complex problems, it has not been employed for MPCLSP-IT problem. This paper solves the MPCLSP-IT problem in large scale instances by using a genetic algorithm, and in doing so successfully obtains a better solution in terms of computation time when compared to the results obtained by the other methods such as Lagrangian relaxation, greedy randomized adaptive search procedure (GRASP) heuristics, and GRASP-path relinking techniques used in extant literature.
APA, Harvard, Vancouver, ISO, and other styles
6

Li, Chung-Lun, and Qingying Li. "Polynomial-Time Solvability of Dynamic Lot Size Problems." Asia-Pacific Journal of Operational Research 33, no. 03 (June 2016): 1650018. http://dx.doi.org/10.1142/s0217595916500184.

Full text
Abstract:
There has been a lot of research on dynamic lot sizing problems with different nonlinear cost structures due to capacitated production, minimum order quantity requirements, availability of quantity discounts, etc. Developing optimal solutions efficiently for dynamic lot sizing models with nonlinear cost functions is a challenging topic. In this paper, we present a set of sufficient conditions such that if a single-item dynamic lot sizing problem satisfies these conditions, then the existence of a polynomial-time solution method for the problem is guaranteed. Several examples are presented to demonstrate the use of these sufficient conditions.
APA, Harvard, Vancouver, ISO, and other styles
7

You, Meng, Yiyong Xiao, Siyue Zhang, Shenghan Zhou, Pei Yang, and Xing Pan. "Modeling the Capacitated Multi-Level Lot-Sizing Problem under Time-Varying Environments and a Fix-and-Optimize Solution Approach." Entropy 21, no. 4 (April 7, 2019): 377. http://dx.doi.org/10.3390/e21040377.

Full text
Abstract:
In this study, we investigated the time-varying capacitated lot-sizing problem under a fast-changing production environment, where production factors such as the setup costs, inventory-holding costs, production capacities, or even material prices may be subject to continuous changes during the entire planning horizon. Traditional lot-sizing theorems and algorithms, which often assume a constant production environment, are no longer fit for this situation. We analyzed the time-varying environment of today’s agile enterprises and modeled the time-varying setup costs and the time-varying production capacities. Based on these, we presented two mixed-integer linear programming models for the time-varying capacitated single-level lot-sizing problem and the time-varying capacitated multi-level lot-sizing problem, respectively, with considerations on the impact of time-varying environments and dynamic capacity constraints. New properties of these models were analyzed on the solution’s feasibility and optimality. The solution quality was evaluated in terms of the entropy which indicated that the optimized production system had a lower value than that of the unoptimized one. A number of computational experiments were conducted on well-known benchmark problem instances using the AMPL/CPLEX to verify the proposed models and to test the computational effectiveness and efficiency, which showed that the new models are applicable to the time-varying environment. Two of the benchmark problems were updated with new best-known solutions in the experiments.
APA, Harvard, Vancouver, ISO, and other styles
8

Cheng, C. H., M. S. Madan, Y. Gupta, and S. So. "Solving the capacitated lot-sizing problem with backorder consideration." Journal of the Operational Research Society 52, no. 8 (August 2001): 952–59. http://dx.doi.org/10.1057/palgrave.jors.2601166.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Brandimarte, P., A. Alfieri, and R. Levi. "LP-Based Heuristics for the Capacitated Lot Sizing Problem." CIRP Annals 47, no. 1 (1998): 423–26. http://dx.doi.org/10.1016/s0007-8506(07)62866-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

SOX, CHARLES R., and YUBO GAO. "The capacitated lot sizing problem with setup carry-over." IIE Transactions 31, no. 2 (February 1999): 173–81. http://dx.doi.org/10.1080/07408179908969816.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Capacitated Lot Sizing Problem"

1

Miller, Andrew J. "Polyhedral approaches to capacitated lot-sizing problems." Diss., Georgia Institute of Technology, 1999. http://hdl.handle.net/1853/24284.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Mahdieh, M. "Integrated capacitated lot sizing and scheduling problems in a flexible flow line." Thesis, University of the West of England, Bristol, 2013. http://eprints.uwe.ac.uk/21584/.

Full text
Abstract:
The lot sizing and scheduling problem in a Flexible Flow Line (FFL) has extensive real-world applications in many industries. An FFL consists of several production stages in series with parallel machines at each stage. The decisions to be taken are the determination of production quantities (lots), machine assignments and production sequences (schedules) on each machine at each stage in an FFL. Lot sizing and scheduling problems are closely interrelated. Solving them separately and then coordinating their interdependencies is often ineffective. However due to their complexity, there is a lack of mathematical modelling and solution procedures in the literature to combine and jointly solve them. Up to now most research has been focused on combining lotsizing and scheduling for the single machine configuration, and research on other configurations like FFL is sparse. This thesis presents several mathematical models with practical assumptions and appropriate algorithms, along with experimental test problems, for simultaneously lotsizing and scheduling in FFL. This problem, called the ‘General Lot sizing and Scheduling Problem in a Flexible Flow Line’ (GLSP-FFL). The objective is to satisfy varying demand over a finite planning horizon with minimal inventory, backorder and production setup costs. The problem is complex as any product can be processed on any machine, but these have different processing rates and sequence-dependent setup times & costs. As a result, even finding a feasible solution of large problems in reasonable time is impossible. Therefore the heuristic solution procedure named Adaptive Simulated Annealing (ASA), with four well-designed initial solutions, is designed to solve GLSP-FFL. A further original contribution of this study is to design linear mixed-integer programming (MILP) formulations for this problem, incorporating all necessary features of setup carryovers, setup overlapping, non-triangular setup while allowing multiple lot production per periods, lot splitting and sequencing through ATSP-adaption based on a variety of subtour elimination.
APA, Harvard, Vancouver, ISO, and other styles
3

Darwish, Mohammed. "Lot-sizing and scheduling optimization using genetic algorithm." Thesis, Högskolan i Skövde, Institutionen för ingenjörsvetenskap, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-17045.

Full text
Abstract:
Simultaneous lot-sizing and scheduling problem is the problem to decide what products to be produced on which machine and in which order, as well as the quantity of each product. Problems of this type are hard to solve. Therefore, they were studied for years, and a considerable number of papers is published to solve different lotsizing and scheduling problems, specifically real-case problems. This work proposes a Real-Coded Genetic Algorithm (RCGA) with a new chromosome representation to solve a non-identical parallel machine capacitated lot-sizing and scheduling problem with sequence dependent setup times and costs, machine cost and backlogging. Such a problem can be found in real world production line at furniture manufacturer in Sweden. Backlogging is an important concept in this problem, and it is often ignored in the literature. This study implements three different types of crossover; one of them has been chosen based on numerical experiments. Four mutation operators have been combined together to allow the genetic algorithm to scan the search area and maintain genetic diversity. Other steps like initializing of the population and a reinitializing process have been designed carefully to achieve the best performance and to prevent the algorithm from trapped into the local optimum. The proposed algorithm is implemented and coded in MATLAB and tested for a set of standard medium to large-size problems taken from the literature. A variety of problems were solved to measure the impact of different characteristics of problems such as the number of periods, machines, and products on the quality of the solution provided by the proposed RCGA. To evaluate the performance of the proposed algorithm, the average deviation from the lower bound and runtime for the proposed RCGA are compared with three other algorithms from the literature. The results show that, in addition to its high computational speed, the proposed RCGA outperforms the other algorithms for non-identical parallel machine problems, while it is outperformed by the other algorithms for problems with the more identical parallel machine. The results show that the different characteristics of problem instances, like increasing setup cost, and size of the problem influence the quality of the solutions provided by the proposed RCGA negatively.
APA, Harvard, Vancouver, ISO, and other styles
4

Anemyr, Mattias. "Optimization of Production Scheduling at IKEA Industry Hultsfred." Thesis, Linköpings universitet, Kommunikations- och transportsystem, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-167145.

Full text
Abstract:
IKEA Industry has factories in several locations where one location is in Hultsfred, Småland. IKEA Industry Hultsfred produces IKEA:s wardrobe collection PAX. In 2018, 2.8 million wardrobes were manufactured in Hultsfred. This thesis covers the subject of constructing and developing an optimization model which has the same characteristics as the plinth production at IKEA Industry Hultsfred. This means that the optimization model must consider production sequence; the setup time is different depending on which products that have been produced in the machine earlier. The thesis also covers to investigate how much time that is necessary to produce the plinths to Hultsfred, Portugal, and Germany under different circumstances. This thesis also balances inventory levels and setup time. I.e., how the inventory levels are changed if more emphasis is put into minimizing setup time, and the other way around. The results show that lower inventory levels and setup times are achievable over seven days if the production planning technique is changed.
APA, Harvard, Vancouver, ISO, and other styles
5

Baldo, Tamara Angélica. "Geração de colunas para o problema de dimensionamento de lotes de produção com limitações de capacidade." Universidade de São Paulo, 2009. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-28042010-141209/.

Full text
Abstract:
O problema de dimensionamento de lotes com restrições de capacidade (CLSP) consiste em determinar um plano de produção que satisfaça a demanda requerida, respeitando as limitações de capacidade, com o menor custo possível, ou seja, minimizando os custos de produção, estocagem e preparação de máquina. Encontrar uma solução factível para o CLSP, considerando tempo de preparação de máquina, é NP-completo. Nesta dissertação, para a resolução do CLSP, utiliza-se a decomposição de Dantzig-Wolfe e o procedimento de geração de colunas, encontrando bons limitantes inferiores. Duas diferentes estratégias de decomposição são exploradas, decomposição por itens e períodos. Para a obtenção de uma solução inteira para o problema (limitante superior) foram exploradas heurísticas lagrangianas, onde a solução inicial para as heurísticas provém da geração de colunas. Os limitantes obtidos podem ser utilizados em métodos exatos, como por exemplo, em algoritmos do tipo branch-and-price. Experimentos computacionais, baseados em exemplares gerados aleatoriamente, foram realizados e os resultados analisados, as variações dos parâmetros das instâncias foram sugeridas na literatura
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, we are particularly concerned in using the methodology of Dantzig-Wolfe decomposition and column generation to generate good bounds to the CLSP with setup times and costs. Here, we analyse two types of decomposition which are based on items and time periods (lower bound) and some lagrangian-based heuristics (upper bound). Numerical results based on randomly generated intances suggest that highquality lower bounds are obtained by column generation algorithms, such as well as upper bounds by heuristics. These bounds are useful in exact solution methods, such as branch-and-price algorithms
APA, Harvard, Vancouver, ISO, and other styles
6

Leung, Janny M. Y., Thomas L. Magnanti, and Rita Vachani. "Facets and Algorithms for Capacitated Lot Sizing." Massachusetts Institute of Technology, Operations Research Center, 1987. http://hdl.handle.net/1721.1/5210.

Full text
Abstract:
The dynamic economic lot sizing model, which lies at the core of numerous production planning applications, is one of the most highly studied models in all of operations research. And yet, capacitated multi-item versions of this problem remain computationally elusive. We study the polyhedral structure of an integer programming formulation of a single-item capacitated version of this problem, and use these results to develop solution methods for multi-item applications. In particular, we introduce a set of valid inequalities for the problem and show that they define facets of the underlying integer programming polyhedron. Computational results on several single and multiple product examples show that these inequalities can be used quite effectively to develop an efficient cutting plane/branch and bound procedure. Moreover, our results show that in many instances adding certain of these inequalities a priori to the problem formulation, and avoiding the generation of cutting planes, can be equally effective.
APA, Harvard, Vancouver, ISO, and other styles
7

Önal, Mehmet. "Extensions to the economic lot sizing problem." [Gainesville, Fla.] : University of Florida, 2009. http://purl.fcla.edu/fcla/etd/UFE0024781.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Trouiller, Cyril. "Capacitated multi-item lot sizing with an interior point cutting plane algorithm." Thesis, McGill University, 1995. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=23429.

Full text
Abstract:
The capacitated multi-item lot sizing problem is a model which aims at scheduling production of several products over a finite number of periods, while minimizing production costs, holding inventory costs and setup costs subject to demand and capacity constraints. These costs may vary for each product and each period and are all linear. Our model includes setup times for each product.
We compare two approaches: a classic Lagrangean relaxation of the capacity constraints and a Lagrangean decomposition by variable splitting. In both cases, the Lagrangean multipliers are updated with an interior point cutting plane technique. The results show: (1) The superiority of the interior point method over the commonly used subgradient optimization in terms of accuracy at termination, number of iterations and ease of utilization. (2) The better quality of the bounds obtained by the Lagrangean decomposition by variable splitting over the Lagrangean relaxation.
APA, Harvard, Vancouver, ISO, and other styles
9

Huaccha, Neyra Jackeline del Carmen [UNESP]. "Estudos em problemas de dimesionamento de lotes com preparações carryover e crossover." Universidade Estadual Paulista (UNESP), 2017. http://hdl.handle.net/11449/149955.

Full text
Abstract:
Submitted by JACKELINE DEL CARMEN HUACCHA NEYRA null (jacky_157_93@hotmail.com) on 2017-03-24T15:38:11Z No. of bitstreams: 1 dissertação jackeline.pdf: 1416143 bytes, checksum: 3865afc18803fe4e45d315a9ee3afaf9 (MD5)
Approved for entry into archive by Luiz Galeffi (luizgaleffi@gmail.com) on 2017-03-24T18:02:08Z (GMT) No. of bitstreams: 1 huacchaneyra_jc_me_sjrp.pdf: 1416143 bytes, checksum: 3865afc18803fe4e45d315a9ee3afaf9 (MD5)
Made available in DSpace on 2017-03-24T18:02:08Z (GMT). No. of bitstreams: 1 huacchaneyra_jc_me_sjrp.pdf: 1416143 bytes, checksum: 3865afc18803fe4e45d315a9ee3afaf9 (MD5) Previous issue date: 2017-03-13
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Os problemas de dimensionamento de lotes consistem em determinar a quantidade de itens que devem ser produzidos em todos os períodos de um horizonte de planejamento. Em geral, são considerados custos de produção, preparação de máquina e de manutenção de estoque. Neste trabalho estuda-se uma extensão do problema de dimensionamento de lotes com restrição de capacidade que considera tempos de preparação, preparação carryover e crossover, em que se tem uma única máquina, único estágio, multi-itens e big-bucket (CLSP-SCC). Novas formulações para o CLSP-SCC são apresentadas e evitam a necessidade de definir novas variáveis binárias para modelar a preparação crossover. Também são propostas restrições de quebra de simetria para formulações propostas na literatura. São provadas as relações teóricas que existem entre cada uma destas formulações estudadas. Além disso, é proposta uma heurística híbrida que combina as heurísticas Relax-and-Fix e Fix-and-Optimize (RF-FO), em que a heurística Relax-and-Fix é usada para obter uma solução inicial e a heurística Fix-and-Optimize melhora essa solução. Por fim, apresentam-se os resultados computacionais e conclui-se que os resultados obtidos melhoram significativamente quando comparam-se a formulação clássica com as formulações sem preparação carryover. Compara-se também os resultados da heurística com os do pacote computacional CPLEX e, quando ambos são limitados ao mesmo tempo computacional, a heurística RF-FO obtém melhores resultados.
Lot-Sizing Problems consist of determining the quantity of items to be produced in each period of a planning horizon. In general, production, setup and inventory costs are considered. In this work an extension of the Capacitated Lot-Sizing Problem is studied, which considers setup times, Setup Carryover and Setup Crossover, single machine, single level, multi items, multi periods and big-bucket (CLSP-SCC). New formulations to the CLSP-SCC are presented and avoid the necessity of defining new extra binary variables to model the setup crossover. Furthermore, symmetry breaking constraints are proposed for formulations from the literature. The theoretical relations between the studied formulations are proved. A Relax-and-Fix and Fixand-Optimize (RF-FO) hybrid heuristic is proposed, in which the Relax-and-Fix helps to find an initial solution and the Fix-and-Optimize improves it. Computational results are presented and the obtained results improve significantly when comparing the classical formulation with the formulation without setup carryover. Finally, the results obtained by the RF-FO heuristic and the computational package CPLEX are compared and, when they both are limited to the same computational time, the RF-FO heuristic obtains better results.
APA, Harvard, Vancouver, ISO, and other styles
10

Van, Hoesel Stan, and Albert Wagelmans. "Sensitivity Analysis of the Economic Lot-Sizing Problem." Massachusetts Institute of Technology, Operations Research Center, 1990. http://hdl.handle.net/1721.1/5146.

Full text
Abstract:
In this paper we study sensitivity analysis of the uncapacitated single level economic lot-sizing problem, which was introduced by Wagner and Whitin about thirty years ago. In particular we are concerned with the computation of the maximal ranges in which the numerical problem parameters may vary individually, such that a solution already obtained remains optimal. Only recently it was discovered that faster algorithms than the Wagner-Whitin algorithm exist to solve the economic lot-sizing problem. Moreover, these algorithms reveal that the problem has more structure than was recognized so far. When performing the sensitivity analysis we exploit these newly obtained insights.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Capacitated Lot Sizing Problem"

1

Ramya, Ravi, Chandrasekharan Rajendran, Hans Ziegler, Sanjay Mohapatra, and K. Ganesh. Capacitated Lot Sizing Problems in Process Industries. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-01222-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ziegler, Hans, Sanjay Mohapatra, K. Ganesh, Ravi Ramya, and Chandrasekharan Rajendran. Capacitated Lot Sizing Problems in Process Industries. Springer, 2019.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

(Editor), W. Domschke, and H. O. Gunther (Editor), eds. Multi-Level Lot Sizing and Scheduling: Methods for Capacitated, Dynamic, and Deterministic Models (Production and Logistics). Physica-Verlag, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Capacitated Lot Sizing Problem"

1

Ramya, Ravi, Chandrasekharan Rajendran, Hans Ziegler, Sanjay Mohapatra, and K. Ganesh. "Capacitated Lot Sizing Problem with Production Carryover and Setup Crossover Across Periods (CLSP:PCSC): Mathematical Model 1 (MM1) and a Heuristic for Process Industries." In Capacitated Lot Sizing Problems in Process Industries, 47–102. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-01222-9_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ramya, Ravi, Chandrasekharan Rajendran, Hans Ziegler, Sanjay Mohapatra, and K. Ganesh. "Further Development: Mathematical Model 2 (MM2) and a Comprehensive Heuristic for Capacitated Lot Sizing Problem with Production Carryover and Setup Crossover Across Periods for Process Industries." In Capacitated Lot Sizing Problems in Process Industries, 103–30. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-01222-9_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ramya, Ravi, Chandrasekharan Rajendran, Hans Ziegler, Sanjay Mohapatra, and K. Ganesh. "Capacitated Lot Sizing Problem with Production Carryover and Setup Crossover Across Periods Assuming Sequence-Dependent Setup Times and Setup Costs (CLSP-SD-PCSC): Mathematical Models for Process Industries." In Capacitated Lot Sizing Problems in Process Industries, 131–82. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-01222-9_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ramya, Ravi, Chandrasekharan Rajendran, Hans Ziegler, Sanjay Mohapatra, and K. Ganesh. "Introduction." In Capacitated Lot Sizing Problems in Process Industries, 1–31. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-01222-9_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ramya, Ravi, Chandrasekharan Rajendran, Hans Ziegler, Sanjay Mohapatra, and K. Ganesh. "CLSP: Real Life Applications and Motivation to Study Lot Sizing Problems in Process Industries." In Capacitated Lot Sizing Problems in Process Industries, 33–45. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-01222-9_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ramya, Ravi, Chandrasekharan Rajendran, Hans Ziegler, Sanjay Mohapatra, and K. Ganesh. "Summary Concerning Theoretical Developments." In Capacitated Lot Sizing Problems in Process Industries, 183–86. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-01222-9_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Haase, Knut, and Udo Kohlmorgen. "Parallel Genetic Algorithm for the Capacitated Lot-Sizing Problem." In Operations Research Proceedings, 370–75. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/978-3-642-80117-4_64.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ma, Hui-min, Meng-jun Xu, and Shuang Zhang. "Disruption Management for the Single Level Capacitated Dynamic Lot-Sizing Problem." In International Asia Conference on Industrial Engineering and Management Innovation (IEMI2012) Proceedings, 439–48. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38445-5_45.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Caserta, Marco, and Stefan Voß. "A Math-Heuristic Dantzig-Wolfe Algorithm for the Capacitated Lot Sizing Problem." In Lecture Notes in Computer Science, 31–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-34413-8_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Iris, Cagatay, and Mehmet Mutlu Yenisey. "An Efficient Heuristic Algorithm for Capacitated Lot Sizing Problem with Overtime Decisions." In Advances in Production Management Systems. Value Networks: Innovation, Technologies, and Management, 107–14. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33980-6_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Capacitated Lot Sizing Problem"

1

Zhang, Zhicong, Weiping Wang, Shouyan Zhong, and Kaishun Hu. "A solution to the capacitated lot sizing problem." In 2011 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM). IEEE, 2011. http://dx.doi.org/10.1109/ieem.2011.6117978.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ma, Huimin, Chunming Ye, and Shuang Zhang. "Knowledge Evolution Algorithm for Capacitated Lot Sizing Problem." In 2009 International Joint Conference on Computational Sciences and Optimization, CSO. IEEE, 2009. http://dx.doi.org/10.1109/cso.2009.343.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zhang, Zhicong, Weiping Wang, Shouyan Zhong, and Kaishun Hu. "A solution to the capacitated lot sizing problem." In 2011 IEEE MTT-S International Microwave Workshop Series on Innovative Wireless Power Transmission: Technologies, Systems, and Applications (IMWS 2011). IEEE, 2011. http://dx.doi.org/10.1109/imws.2011.6115210.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Godichaud, Matthieu, Lionel Amodeo, and Mustapha Hrouga. "Metaheuristic based optimization for capacitated disassembly lot sizing problem with lost sales." In 2015 International Conference on Industrial Engineering and Systems Management (IESM). IEEE, 2015. http://dx.doi.org/10.1109/iesm.2015.7380324.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Masmoudi, Oussama, Alice Yalaoui, Yassine Ouazene, and Hicham Chehade. "A Multi-Level Capacitated Lot-Sizing Problem with energy consideration." In 2015 International Conference on Industrial Engineering and Systems Management (IESM). IEEE, 2015. http://dx.doi.org/10.1109/iesm.2015.7380327.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Daoming Dai, Chengbin Chu, and Shanlin Yang. "The Optimal Pricing and Multi-Item Capacitated Lot Sizing Problem." In 2006 6th World Congress on Intelligent Control and Automation. IEEE, 2006. http://dx.doi.org/10.1109/wcica.2006.1714502.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Cheng, Zhihong, Badurdeen Fazleena, Guangzhu Chen, and Ding Gao. "Scheduling optimization of capacitated lot sizing problem based on immune complement algorithm." In 2010 International Conference on Computer Design and Applications (ICCDA 2010). IEEE, 2010. http://dx.doi.org/10.1109/iccda.2010.5541221.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Haojie, Yang, Miao Lixin, and Zhang Canrong. "Capacitated lot-sizing problem with one-way substitution: A robust optimization approach." In 2017 3rd International Conference on Information Management (ICIM). IEEE, 2017. http://dx.doi.org/10.1109/infoman.2017.7950367.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kaganova, Ekaterina, Ilias Kotsireas, Roderick Melnik, and Brian West. "Worst case analysis for deterministic online algorithm in capacitated lot-sizing problem." In ADVANCES IN MATHEMATICAL AND COMPUTATIONAL METHODS: ADDRESSING MODERN CHALLENGES OF SCIENCE, TECHNOLOGY, AND SOCIETY. AIP, 2011. http://dx.doi.org/10.1063/1.3663492.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Toledo, Claudio Fabiano Motta, Renato Resende Ribeiro de Oliveira, and Paulo Morelato Franca. "A hybrid heuristic approach to solve the multi level capacitated lot sizing problem." In 2011 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2011. http://dx.doi.org/10.1109/cec.2011.5949752.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Capacitated Lot Sizing Problem' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography