Capacitated dynamic lot-sizing problem with delivery/production time windows

Hwang, Ho Jung; Jaruphongsa, Wikrom; Çetinkaya, Sıla; Lee, C. Y.

doi:10.1016/j.orl.2010.04.009

Cited by 13 publications

(4 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is worth noting that, if demand-splitting is not allowed, the problem becomes NP-hard (reduction to a 2-Partition problem). (Hwang et al, 2010). Furthermore, in the capacitated problem with delivery time windows (CP_TW), not only may a demand need to be split for production purposes, but, also, it is allowed to be released in multiple dispatches during the appropriate time window.…”

Section: Variants Of Clspmentioning

confidence: 99%

DYNAMIC LOT-SIZING PROBLEMS: A Review on Model and Efficient Algorithm

Suwondo¹,

Yuliando²

2017

Agroindustrial J.

View full text Add to dashboard Cite

Due to their importance in industry, dynamic demand lot-sizing problems are frequently studied.This study consider dynamic lot-sizing problems with recent advances in problem and modelformulation, and algorithms that enable large-scale problems to be effectively solved.Comprehensive review is given on model formulation of dynamic lot-sizing problems, especiallyon capacitated lot-sizing (CLS) problem and the coordinated lot-sizing problem. Bothapproaches have their intercorrelated, where CLS can be employed for single or multilevel/stage, item, and some restrictions. When a need for joint setup replenishment exists, thenthe coordinated lot-sizing is the choice. Furthermore, both algorithmics and heuristics solutionin the research of dynamic lot sizing are considered, followed by an illustration to provide anefficient algorithm.

show abstract

Section: Variants Of Clspmentioning

confidence: 99%

DYNAMIC LOT-SIZING PROBLEMS: A Review on Model and Efficient Algorithm

Suwondo¹,

Yuliando²

2017

Agroindustrial J.

View full text Add to dashboard Cite

show abstract

“…They respectively consider the effects of backlogging to the model and provide O(T 3 ) and O(T 5 ) algorithms to solve the models without or with backlogging. Hwang et al (2010) investigate a capacitated single item lot-sizing problem with production time windows, in which n types of demands are involved in production. They propose an O(nT 3 ) dynamic programming algorithm to solve the model.…”

Section: Capacitated Single-item Lot Sizing Problemsmentioning

confidence: 99%

Dual-mode production planning for manufacturing with emission constraints

Hong

Chen

2016

European Journal of Operational Research

View full text Add to dashboard Cite

show abstract

“…Classical dynamic lot-sizing problem by considering production capacity constraints as well as delivery and/or production time windows was summarized (Hwang, Jaruphongsa, Çetinkaya & Lee, 2010). They used an untraditional decomposition principle.…”

Section: Literature Reviewmentioning

confidence: 99%

Dynamic Lot Optimization of Assembly Supply Chain with Delivery Time Constraint

Li¹,

Zhang

Jin³

2013

IBR

View full text Add to dashboard Cite

In this paper, we investigate operational decision optimization problem of assembly manufacturing capacitated supply chain. Open equations of this system in all planning periods are set up. Delivery time to clients form a time window that limits point to assembly manufacturer delivery start and end time. The system model divide planning time into many equally periods, and decisions can vary with time. Ability constraint in the process of supply chain operation, time constraints and assembly production constrain are all considered in the inventory control dynamic batch optimization model. We solve the optimization problem by hybrid mixed integral optimization and SQP algorithm. At last, we examine a set of numerical examples that reveal the insights into the dynamic inventory control policy and the performance of such an assembly type inventory mode.

show abstract

Capacitated dynamic lot-sizing problem with delivery/production time windows

Cited by 13 publications

References 21 publications

DYNAMIC LOT-SIZING PROBLEMS: A Review on Model and Efficient Algorithm

DYNAMIC LOT-SIZING PROBLEMS: A Review on Model and Efficient Algorithm

Dual-mode production planning for manufacturing with emission constraints

Dynamic Lot Optimization of Assembly Supply Chain with Delivery Time Constraint

Contact Info

Product

Resources

About