A. Akbalik - Academia.edu (original) (raw)

Uploads

Papers by A. Akbalik

Research paper thumbnail of Single-item lot sizing problem with carbon emission under the cap-and-trade policy

2014 International Conference on Control, Decision and Information Technologies (CoDIT), 2014

Research paper thumbnail of Dynamic programming approach for a capacitated lot sizing problem coupled with transportation activi

Research paper thumbnail of Optimisation conjointe des activités de production, de transport et de stockage dans une chaîne logistique

Research paper thumbnail of Two dynamic programming formulations in the extension of the simultaneous optimization of an inbound supply chain

Research paper thumbnail of A global approach to optimize a two echelon supply chain: Suppliers-Manufacturer

Research paper thumbnail of New results on the lot sizing problem with multi-mode replenishment

Research paper thumbnail of Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost

This paper presents two polynomial time algorithms for the constant capacitated lot sizing proble... more This paper presents two polynomial time algorithms for the constant capacitated lot sizing problem with a batch production. We give several optimality properties for the general problem. Assuming constant production capacity, constant batch size and Wagner-Whitin cost structure, we derive O(T 4 ) and O(T 6 ) time algorithms respectively for the case with production capacity multiple of the batch size and for the case with arbitrary fixed capacities.

Research paper thumbnail of Capacitated lot sizing problem with inventory bounds

ABSTRACT We study a multi-item lot sizing problem with inventory bounds, where the production of ... more ABSTRACT We study a multi-item lot sizing problem with inventory bounds, where the production of the items is uncapacitated but a storage capacity is considered, limiting at each period the amount of products that can be held in stock. We prove that the problem is strongly NP-hard even with no holding cost and stationary setup costs. For non-speculative costs, this lot-sizing problem remains NP-hard even when restricted to only 2 periods. However, in this case, we show that it can be polynomially solved for any fixed number of items.

Research paper thumbnail of Optimization in an integrated supply chain: two heuristics and one exact method

Research paper thumbnail of Un algorithme de programmation dynamique pour l'optimisation d'une chaîne logistique production-transport-stockage

Research paper thumbnail of Multi-item uncapacitated lot sizing problem with inventory bounds

Optimization Letters, 2014

ABSTRACT We study a multi-item lot sizing problem with inventory bounds, where the production of ... more ABSTRACT We study a multi-item lot sizing problem with inventory bounds, where the production of the items is uncapacitated but a storage capacity is considered, limiting at each period the amount of products that can be held in stock. We prove that the problem is strongly NP-hard even with no holding cost and stationary setup costs. For non-speculative costs, this lot-sizing problem remains NP-hard even when restricted to only 2 periods. However, in this case, we show that it can be polynomially solved for any fixed number of items.

Research paper thumbnail of Dynamic programming approaches for solving an inbound supply chain planning problem

Research paper thumbnail of Comparison of just-in-time and time window delivery policies for a single-item capacitated lot sizing problem

International Journal of Production Research - INT J PROD RES, 2011

In this article, a comparative discussion between just-in-time (JIT) and time window (TW) policie... more In this article, a comparative discussion between just-in-time (JIT) and time window (TW) policies is performed for a special case of the single-item capacitated lot sizing problem (CLSP), in which two storage levels are available, including plant and customer levels. In the JIT policy, the customer demand has to be satisfied on the due date of the demand, however, in the TW policy, the shipment can be made a few days before the due date. The influence of the two policies on the total cost is studied for a structure of a single capacitated plant which replenishes a customer, both having storage spaces. Both planning problems are shown to be NP-hard using the well-known CLSP which constitutes their subpart. A mixed integer linear program and a pseudo-polynomial dynamic program are proposed for each policy. The objective of this article is first to solve the TW problem to the optimality and, second to show the gain obtained by TW policy in terms of cost reduction. For the benchmark, w...

Research paper thumbnail of Single-item lot sizing problem with carbon emission under the cap-and-trade policy

2014 International Conference on Control, Decision and Information Technologies (CoDIT), 2014

Research paper thumbnail of Dynamic programming approach for a capacitated lot sizing problem coupled with transportation activi

Research paper thumbnail of Optimisation conjointe des activités de production, de transport et de stockage dans une chaîne logistique

Research paper thumbnail of Two dynamic programming formulations in the extension of the simultaneous optimization of an inbound supply chain

Research paper thumbnail of A global approach to optimize a two echelon supply chain: Suppliers-Manufacturer

Research paper thumbnail of New results on the lot sizing problem with multi-mode replenishment

Research paper thumbnail of Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost

This paper presents two polynomial time algorithms for the constant capacitated lot sizing proble... more This paper presents two polynomial time algorithms for the constant capacitated lot sizing problem with a batch production. We give several optimality properties for the general problem. Assuming constant production capacity, constant batch size and Wagner-Whitin cost structure, we derive O(T 4 ) and O(T 6 ) time algorithms respectively for the case with production capacity multiple of the batch size and for the case with arbitrary fixed capacities.

Research paper thumbnail of Capacitated lot sizing problem with inventory bounds

ABSTRACT We study a multi-item lot sizing problem with inventory bounds, where the production of ... more ABSTRACT We study a multi-item lot sizing problem with inventory bounds, where the production of the items is uncapacitated but a storage capacity is considered, limiting at each period the amount of products that can be held in stock. We prove that the problem is strongly NP-hard even with no holding cost and stationary setup costs. For non-speculative costs, this lot-sizing problem remains NP-hard even when restricted to only 2 periods. However, in this case, we show that it can be polynomially solved for any fixed number of items.

Research paper thumbnail of Optimization in an integrated supply chain: two heuristics and one exact method

Research paper thumbnail of Un algorithme de programmation dynamique pour l'optimisation d'une chaîne logistique production-transport-stockage

Research paper thumbnail of Multi-item uncapacitated lot sizing problem with inventory bounds

Optimization Letters, 2014

ABSTRACT We study a multi-item lot sizing problem with inventory bounds, where the production of ... more ABSTRACT We study a multi-item lot sizing problem with inventory bounds, where the production of the items is uncapacitated but a storage capacity is considered, limiting at each period the amount of products that can be held in stock. We prove that the problem is strongly NP-hard even with no holding cost and stationary setup costs. For non-speculative costs, this lot-sizing problem remains NP-hard even when restricted to only 2 periods. However, in this case, we show that it can be polynomially solved for any fixed number of items.

Research paper thumbnail of Dynamic programming approaches for solving an inbound supply chain planning problem

Research paper thumbnail of Comparison of just-in-time and time window delivery policies for a single-item capacitated lot sizing problem

International Journal of Production Research - INT J PROD RES, 2011

In this article, a comparative discussion between just-in-time (JIT) and time window (TW) policie... more In this article, a comparative discussion between just-in-time (JIT) and time window (TW) policies is performed for a special case of the single-item capacitated lot sizing problem (CLSP), in which two storage levels are available, including plant and customer levels. In the JIT policy, the customer demand has to be satisfied on the due date of the demand, however, in the TW policy, the shipment can be made a few days before the due date. The influence of the two policies on the total cost is studied for a structure of a single capacitated plant which replenishes a customer, both having storage spaces. Both planning problems are shown to be NP-hard using the well-known CLSP which constitutes their subpart. A mixed integer linear program and a pseudo-polynomial dynamic program are proposed for each policy. The objective of this article is first to solve the TW problem to the optimality and, second to show the gain obtained by TW policy in terms of cost reduction. For the benchmark, w...

Log In