E cient methods for the lot sizing problem

Efficient methods for the lot sizing problem

Ayse Akbalık

21/09/2020

HdR defense in Computer Science

1

2

Background

Outline

1 Background

2 My research activitiesOverview on the single-item lot sizing problem (LSP)My main contributions to the literatureLSP under capacity reservation contract

3 Projects

Ayse Akbalık HdR defense 2 / 77

3

Background

CV


4

Background

CV


5

Background

CV


6

Background

CV


7

Background

CV


8

Background

CV


9

Background

CV


10

Background

CV


11

Background

CV


12

Background

CV


13

Background

My research topics


14

Background

International collaborations


15

Background

Supervisions

Ph.D supervision Mlouka Farhat (Defense : 2019)Co-supervised with N. Sauer and A. Hadj-Alouane.“Lot sizing problem with batch replenishment under buybackcontract”.

M.S. supervisions 7 master students“Fleet sizing, lot sizing, replenishment planning and supplychain optimization topics”.

Industrial projects Master 1 and Master 2 levels“Industrial engineering common topics”.


16

Background

Publication indicators


17

Background

Teaching activities (1)


18

Background

Teaching activities (2)


19

Background

Other activities

Co-president of ROADEF’2017 Conference organization committee(380 participants)


20

Background

Other activities


Member of epiSTEM Turkiye, a volunteer science communicationorganization


21

Background

Other activities


Member of epiSTEM Turkiye, a volunteer science communicationorganization

Erasmus responsible for Turkish universities

Referee for 15 inter. journals (EJOR, IJPE, JORS, C&OR, POM, etc.)


22

My research activities

Outline

1 Background


3 Projects


23

My research activities Overview on the single-item lot sizing problem (LSP)

Outline

1 Background


3 Projects


24


LSP inside ERP

Figure – ERP : Enterprise Resource Planning, PP : Production planning, MRP :Material Requirements Planning, LSP : Lot sizing problem

Source : Y. Pochet, LA. Wolsey, Production Planning for MIP.


25


LSP for production/replenishment


26


LSP for production/replenishment


27


Network representation of LSP


28


Network representation of LSP


29


Lot sizing problem

The aim

To satisfy a deterministic demand over a finite horizon, while minimizingthe total cost.

Several extensions...

Single or multi-item, uncapacitated or capacitated, with or withoutbacklogging/lost sales, time windows, special cost structures, etc.

Important references...

Pochet and Wolsey (2006), Production planning by MIP

Brahimi et al. (2017), EJOR, Updated review on LSP


30


Different tools to model and solve LSP

Polyhedral approach, extended formulations

Dynamic programming

Network flows

Heuristics, matheuristics, etc.


31

My research activities My main contributions to the literature

Outline

1 Background


3 Projects


32


My topics : LSP integrated with other constraints


33


My contributions to the LSP literature


34


Our methodology


35


My theoretical contributions to the LSP literature

Source : Brahimi et al. (2017), EJOR, Single-item dynamic LSP, An updated survey


36


My main contributions to the LSP literature


37

My research activities LSP under capacity reservation contract

Outline

1 Background


3 Projects


38


Capacity Reservation Contracts (CRC)

Reservation of any desired quantity of the capacity at supplier, in exchangeof an advantageous price for the buyer : a risk sharing mechanism.

Once this capacity is exceeded, the purchase price increases : convex costfunction

Fluctuating and uncertain demand, products having short lifecycles,important capacity investments, ex. high-tech industry, Wu et al. (2005).


39


Illustration of LSP with batch replenishment under CRC


40




41




42




43




44




45




46




47




48




49


Literature review

Fixed charge cost Batch orderingParameters AH2001 LL2013 NV2005 Our study

Number of items mono mono multi monoReserved capacity constant constant / ND constant constant/arbitraryBatch production - - yes yes

Batch size - - constant constant/arbitrarySetup cost X X X X

Unit production cost X X - XUnit holding cost X X X X

Fixed cost per batch at - - a atFixed cost per batch bt - - b bt

AH2001 : Atamturk and Hochbaum (2001)LL2013 : Lee and Li (2013)NV2005 : van Norden and van de Velde (2005)


50


Formulation of LSP-BCR without inventory variables

minC0 +T∑t=1

(Ktyt + atAt + btBt + pt′xt − ht

t∑i=1

di )

s.t.t∑

i=1

xi ≥t∑

i=1

di ,∀t = 1, . . . ,T

xt ≤T∑i=t

diyt ,∀t = 1, . . . ,T

xt ≤ Vt(At + Bt),∀t = 1, . . . ,T

At ≤ Rt ,∀t = 1, . . . ,T

xt ∈ R+,At ,Bt ∈ N, yt ∈ {0, 1},∀t = 1, . . . ,T


51


The notation (Kt , at , bt , p′

t ,Rt ,Vt)

The notation (Kt , at , bt , p′t ,Rt ,Vt) is used for parameters : (setup cost,

fixed cost per batch under the reserved capacity, fixed cost per batch overthe reserved capacity, unit modified procurement cost, reserved capacity,batch capacity). The field for a parameter α will take either the value :

’−’ if α is null,

’α’ if it is assumed stationary,

and ’αt ’ if it is allowed to be time-dependent.


52


NP-hardness of (K/at/ +∞/− /Rt/V )

Florian et al. (1980) show that the single item CLSP with constantdemand and null storage cost is NP-hard.

By considering bt = +∞, our problem is transformed into a CLSP.

Furthermore, by setting K = 1 and V = 1, the fixed cost per batch atwill replace the unit procurement cost.

A special case of our problem is thus equivalent to the instanceconsidered in Florian et al. (1980).


53


NP-hardness of (Kt ,−, b,−,−,Vt) or(Kt ,+∞, b,−,+∞,Vt)

With the assumption of bt ≤ at , ∀t, our problem becomes an ULSP.

We obtain an equivalent problem either assuming (at =∞ andRt = +∞) or (Rt = 0 and at = 0).

In Akbalik and Rapine (2013) the ULSP with batch production witharbitrary batch sizes and arbitrary setup costs is shown to be NP-hard.


54


Main assumptions

The batch sizes are assumed to be stationary.

We assume arbitrary costs at and bt to generalize our methods.

The reservation capacities Rt are considered as a multiple of thebatch size V for a given period t.


55


ZIO (zero-inventory-ordering) is not dominant

ZIO property is not dominant for LSP-BCR, even with null setup costs,null unit procurement and holding costs, and stationary capacities,stationary batch sizes.

Figure – An illustrative example for the non-dominant ZIO property forLSP-BCR. R = 9, V = 3, d1 = 5, d2 = 4, a1 > a2, b1 and b2 are higher thancosts a.


56


Case 1. (−, at , bt , p′

t ,Rt ,V ) : Algorithm in O(T 2log(T ))

We double the number of periods as in Akbalik and Rapine (2013) and Helmrich et al.(2015) to

reduce the instance of LSP-BCR into an instance of CLSP-B with time dependent capacities.

Figure – Transformation of LSP-BCR into CLSP-B with 2T periods.Ayse Akbalık HdR defense 56 / 77

57


Case 1. (−, at , bt , p′

t ,Rt ,V ) : Algorithm in O(T 2log(T ))

van Vyve (2007) proposes an algorithm in O(T 2log(T )) for the CLSP-Bwith time-dependent capacities, without setup cost, without backloggingand under the WW cost structure.


58


Case 2. (−, at , bt , p′,Rt ,V ) : Algorithm in O(Tlog(T ))

The idea of the algorithm is to produce in the periods with the least ctcosts, while satisfying demands without backlogging. The Insertion Sortalgorithm is used for ordering periods in non-decreasing (ND) order oftheir fixed costs per batch ct and in each step saturating the least costperiods. The overall algorithm takes O(Tlog(T )) time.


59


Case 3. (K , a,+∞,−,Rt ,V ) : Algorithm in O(Tlog(T ))

Note that with infinite spot market costs, the problem becomesCLSP-B with time-dependent capacities.

The algorithm is based on ordering units in periods with the largestremaining capacity.

We use the well known heap sort algorithm with an O(Tlog(T )) timecomplexity to choose the largest value among all existing capacities inthe heap.

Case 4. (Kt , a,+∞,−,R,V ) : Algorithm in O(Tlog(T ))

This time the sorting is done over setup costs rather than thecapacities.

A positive quantity is ordered on periods with the lowest setup costfirst.


60


Our contributions : Polynomial time algorithms

Table – Polynomial time algorithms proposed in this study.

Kt at bt p′t Rt Vt Complexity results- at bt p′t Rt V O(T 2log(T ))- at bt p′ Rt V O(Tlog(T ))K a +∞ - Rt V O(Tlog(T ))Kt a +∞ - R V O(Tlog(T ))Kt at +∞ p′t R V O(T 4), R mod V = 0Kt at +∞ p′t R V O(T 6)


61


Our contributions : NP-hardness results

Table – NP-hardness results proposed in this study.

Kt at bt p′t Rt Vt Complexity resultsK at +∞ - Rt V NP-hardKt - - - Rt V NP-hardKt - b - - Vt NP-hardKt +∞ b - +∞ Vt NP-hard- - bt - - Vt NP-hard- +∞ bt - +∞ Vt NP-hard

Perspectives and open cases can be found in the following publication : Akbalik, Hadj-Alouane,Sauer, Ghribi (2017), NP-hard and polynomial cases for the single-item lot sizing problem withbatch ordering under capacity reservation contract, EJOR


62

Projects

Outline

1 Background


3 Projects


63

Projects

My current research projects


64

Projects

My current research projects on LSP


65

Projects

Project “Energy aware LSP”

Project members : C. Gicquel, B. Penz, C. Rapine


66

Projects

Project “Energy aware LSP”

Project members : C. Gicquel, B. Penz, C. Rapine


67

Projects

Project “LSP for glass container industry”

Project members : B. Almada-Lobo, L. Guimaraes, C. Rapine


68

Projects

Project “LSP for glass container industry”

Project members : B. Almada-Lobo, L. Guimaraes, C. Rapine


69

Projects

Our contributions : Multi-item LSP


70

Projects

Project “Cutting Stock & LSP”

Project members : M.A. Caravilla, J.F. Oliveira, C. Rapine, E. Silva


71

Projects

Other projects


72

Projects

Project “Multi-compartment multi-commodity VRP”

Project members : S. Martin, C. Rapine


73

Projects

Project “Multi-compartment multi-commodity VRP”

Project members : S. Martin, C. RapineAyse Akbalık HdR defense 73 / 77

74

Projects

Project “Semi-Fluid Packing”

Products that are non-deformable in one directionBut adopt the form of the container in the other direction


75

Projects

Project “Semi-Fluid Packing”

Project members : J.P. Pedroso, C. Rapine


76

Projects

Perspectives

Many interesting open cases for each LSP studied.

Robustness to take into account for several of them.

Multi-item LSP : use efficient algorithms proposed for single-item LSP.

Integration of the LSP with other interesting optimization problems.


Efficient methods for the lot sizing problem

Ayse Akbalık

21/09/2020

HdR defense in Computer Science

77

E cient methods for the lot sizing problem

Documents

Transcript of E cient methods for the lot sizing problem