Finite horizon planning for a production system with permitted shortage and fixed-interval deliveries

Diponegoro, Ahmad; Sarker, Bhaba R.

doi:10.1016/j.cor.2005.02.019

Cited by 28 publications

(14 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…All reported results are the average of 10 runs of each algorithm. 4 In summary our experiments cover 80 different parameter configurations: …”

Section: Discussionmentioning

confidence: 99%

“…Our use case is a finite horizon two-echelon collaborative production planning problem [4], i.e. companies along a two-level supply chain that wish to jointly optimize their production planning for a bounded time period.…”

Section: Use Casementioning

confidence: 99%

“…P only procures materials from S and is furthermore S's single source of revenue. Moreover, we assume periodical shipping with neglected transportation times [4].…”

Section: Use Casementioning

confidence: 99%

See 2 more Smart Citations

Privacy-Preserving Multi-Objective Evolutionary Algorithms

Funke¹,

Kerschbaum²

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Existing privacy-preserving evolutionary algorithms are limited to specific problems securing only cost function evaluation. This lack of functionality and security prevents their use for many security sensitive business optimization problems, such as our use case in collaborative supply chain management. We present a technique to construct privacypreserving algorithms that address multi-objective problems and secure the entire algorithm including survivor selection. We improve performance over Yao's protocol for privacy-preserving algorithms and achieve solution quality only slightly inferior to the multi-objective evolutionary algorithm NSGA-II.

show abstract

“…All reported results are the average of 10 runs of each algorithm. 4 In summary our experiments cover 80 different parameter configurations: …”

Section: Discussionmentioning

confidence: 99%

Section: Use Casementioning

confidence: 99%

See 1 more Smart Citation

Privacy-Preserving Multi-Objective Evolutionary Algorithms

Funke¹,

Kerschbaum²

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…An example was provided to illustrate his proposed method. Many studies have since been carried out to address various aspects of supply chain optimization [1, [24][25][26][27][28][29][30][31][32][33][34][35]. Examples of these studies are surveyed as follows.…”

Section: Introductionmentioning

confidence: 99%

“…The algorithm was illustrated by a numerical example followed by a sensitivity analysis of the models behavior under different problem parameters. Diponegoro and Sarker [27] studied an ordering policy for raw materials as well as an economic batch size for finished products that are delivered to customers frequently at a fixed interval of time for a finite planning horizon. The problem was then extended to compensate for the lost sales of finished products.…”

Section: Introductionmentioning

confidence: 99%

On Improving Replenishment Lot Size of an Integrated Manufacturing System with Discontinuous Issuing Policy and Imperfect Rework

Lee¹,

Chiu²,

Chang³

2011

AJIBM

View full text Add to dashboard Cite

show abstract

Numerical method for determination of the optimal lot size for a manufacturing system with discontinuous issuing policy and rework

Chiu

Chen

Lin

2010

Int. J. Numer. Meth. Biomed. Engng.

View full text Add to dashboard Cite

SUMMARYThis paper employs numerical method for determination of the optimal lot size for a manufacturing system with discontinuous inventory issuing policy and imperfect rework of random defective items. The classic economic manufacturing quantity (EMQ) model assumes a continuous issuing policy for satisfying customer's demands, and perfect quality production for all items produced during a production run. However, in a real-life vendor-buyer integrated system, the discontinuous issuing policy such as multi-shipment policy is practically used in lieu of continuous issuing policy, and it is inevitable to generate defective items during a production run. Imperfect quality items fall into two groups: the scrap and the reworkable. During the rework process, failure in repair exists; a portion of reworked items fails and becomes scrap. The finished items can only be delivered to customers if the whole lot is quality assured at the end of the rework. Mathematical modeling and analysis are used to deal with the proposed model, and the long-run average cost function is derived. Convexity of this cost function is proved and a closed-form optimal batch size solution to the problem is obtained. Two special cases are examined and a numerical example demonstrates its practical usage.

show abstract

Finite horizon planning for a production system with permitted shortage and fixed-interval deliveries

Cited by 28 publications

References 24 publications

Privacy-Preserving Multi-Objective Evolutionary Algorithms

Privacy-Preserving Multi-Objective Evolutionary Algorithms

On Improving Replenishment Lot Size of an Integrated Manufacturing System with Discontinuous Issuing Policy and Imperfect Rework

Numerical method for determination of the optimal lot size for a manufacturing system with discontinuous issuing policy and rework

Contact Info

Product

Resources

About