Lot-sizing in a multi-stage flow line production system with energy consideration

Masmoudi, Oussama; Yalaoui, Alice; Ouazène, Yassine; Chehade, Hicham

doi:10.1080/00207543.2016.1206670

Cited by 54 publications

(27 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We found a single approach integrating energy-related constraints in a lot-sizing problem. Masmoudi [Masmoudi et al, 2017] consider a single-item multi-stage multi-resource lotsizing problem and introduce constraints setting a strict limit on the maximum instantaneous power demand used in each period. They propose two heuristic solution approaches for their problem and compare their performance to the one of the mathematical programming solver CPLEX.…”

Section: Literature Reviewmentioning

confidence: 99%

Capacity acquisition for the single-item lot sizing problem under energy constraints

Rapine

Penz

Gicquel

et al. 2018

Omega

View full text Add to dashboard Cite

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Capacity acquisition for the single-item lot sizing problem under energy constraints

Rapine

Penz

Gicquel

et al. 2018

Omega

View full text Add to dashboard Cite

show abstract

“…Notice that a limit on the amount of available energy is also considered by Artigues et al [1], Nattaf et al [15], [16], Ngueveu et al [17] and Modos et al [14] for scheduling problems, by Schultz et al [22] for a short term production control problem and by Masmoudi et al [12] for a single-item capacitated LSP. In [12], the authors consider a flow-shop system with a maximum allowable energy level, as well as an electricity price in their objective function. The flow-shop system considered in [12] makes the problem quite different than ours with deadlines to respect.…”

Section: Literature Reviewmentioning

confidence: 99%

“…In [12], the authors consider a flow-shop system with a maximum allowable energy level, as well as an electricity price in their objective function. The flow-shop system considered in [12] makes the problem quite different than ours with deadlines to respect. Moreover, the authors propose heuristics to solve their problem, while we theoretically study our models, analyzing their complexity and proposing polynomial time exact algorithms.…”

Section: Literature Reviewmentioning

confidence: 99%

Energy-aware lot sizing problem: Complexity analysis and exact algorithms

Rapine

Goisque

Akbalιk

2018

International Journal of Production Economics

View full text Add to dashboard Cite

The single-item lot sizing problem under a periodic energy limitation is considered in this paper. Identical and parallel capacitated machines constitute the production system, each one consuming a certain amount of energy when being switched on, when reserved, and when producing. We consider a cost for starting-up the machines, a reservation cost to keep the machines ready for production, in addition to classical lot sizing costs, such as, joint setup cost, unit production cost and unit holding cost, all being time-dependent. Besides the classical lot sizing decisions of how much and in which periods to produce, we have to decide the number of machines to switch on and to switch off in each period. We show that this problem is NP-hard even under restricted conditions. In contrast, assuming stationary energy parameters, we propose two polynomial time dynamic programming algorithms to solve the problem to optimality. The first algorithm is proposed for the case with null setup cost, null reservation cost and null reservation energy consumption, and runs in O(M 5 T 4) time, with M being the number of machines and T the number of periods. We show that we can extend this algorithm to solve the generalized version of the problem in time complexity O(M 6 T 6).

show abstract

“…In the literature, there is a wide range of methods, mainly heuristic ones, to approach lot-sizing problems (Li and Thorstenson, 2014;Masmoudi et al, 2017;Behnamian et, al., 2017;Gu et al, 2017). Although, as far as is known, there is still a lack of contributions to clarify the suitability of those methods regarding each kind of underlying manufacturing environment, either based on MRP (Miclo et al, 2015(Miclo et al, , 2018Wang et al, 2017) or on JIT/Kanban philosophies (Wang et al, 2017, Ani et al, 2018.…”

Section: Introductionmentioning

confidence: 99%

Analysis of lot-sizing methods’ suitability for different manufacturing application scenarios oriented to MRP and JIT/Kanban environments

Florim

Dias

Santos

et al. 2019

BJO&PM

View full text Add to dashboard Cite

Goal: The main goal of this research is to analyse the behaviour of a set of ten lot-sizing methods applied to different application scenarios, within the context of more traditional MRP-based manufacturing environments and on JIT/ Kanbans oriented ones. Design/Methodology/Approach: After an extended literature review, a quantitative research method is used to provide a comparative analysis on the performance of the lot-sizing methods under different simulated application scenarios, with variations in demand and peaks of seasonality. Moreover, a final summary provides the error deviations for lot-sizing methods regarding increases in demand variations and seasonality indexes. Results: The study analyses lot-sizing methods and discusses benefits and risks associated to its use in application scenarios marked by a considerable variation in demand or peaks in seasonality. Limitations of the investigation: As the application scenarios did not explore variations in the ordering and stock holding costs, further analysis including these kinds of variations is encouraged. Practical implications: The findings of this research enable the enhancement of the conscience of industrial practitioners, regarding the selection of best suited lot-sizing methods for being applied on each kind of manufacturing scenario, regarding MRP or JIT/ Kanban environments. Originality/Value: Given the diversity of the existing lot-sizing methods, for instance, the heuristic ones, authors can find it quite difficult to select appropriate methods for solving their problems for each kind of application scenario. Therefore, the present study can provide useful knowledge to better support decision making in the lot-sizing domain.

show abstract

Lot-sizing in a multi-stage flow line production system with energy consideration

Cited by 54 publications

References 18 publications

Capacity acquisition for the single-item lot sizing problem under energy constraints

Capacity acquisition for the single-item lot sizing problem under energy constraints

Energy-aware lot sizing problem: Complexity analysis and exact algorithms

Analysis of lot-sizing methods’ suitability for different manufacturing application scenarios oriented to MRP and JIT/Kanban environments

Contact Info

Product

Resources

About