A MIXED INTEGER MODEL FOR CAPACITATED LOT-SIZING PROBLEM WITH TRIANGULAR SEQUENCE-DEPENDENT SETUP COSTS

Here, we formulate a capacitated lot-sizing problem with triangular sequence-dependent setup costs (CLSPSD). This problem is an extension of the classic capacitated lot-sizing problem (CLSP). Our formulation specifies in each period, how many units of each item must be produced and also determines the sequence of producing the items such that the sum of production, inventory holding and setup costs are minimized.