A fix-and-relax heuristic for the single-item lot-sizing problem with a flow-shop system and energy constraints

2019 ◽  
Vol 58 (21) ◽  
pp. 6532-6552
Author(s):  
Melek Rodoplu ◽  
Taha Arbaoui ◽  
Alice Yalaoui
Keyword(s):  
Flow Shop ◽  
Lot Sizing ◽  
Single Item ◽  
Lot Sizing Problem ◽  
Energy Constraints

scholarly journals Capacity acquisition for the single-item lot sizing problem under energy constraints

Omega ◽  
2018 ◽  
Vol 81 ◽  
pp. 112-122 ◽  
Author(s):  
Christophe Rapine ◽  
Bernard Penz ◽  
Céline Gicquel ◽  
Ayse Akbalik
Keyword(s):  
Lot Sizing ◽  
Single Item ◽  
Lot Sizing Problem ◽  
Energy Constraints ◽  
Capacity Acquisition

scholarly journals A cash constrained single item stochastic lot-sizing problem

2019 ◽  
Vol 52 (13) ◽  
pp. 1479-1483
Author(s):  
Zhen Chen ◽  
Roberto Rossi
Keyword(s):  
Lot Sizing ◽  
Single Item ◽  
Lot Sizing Problem

scholarly journals A Heuristic Approach for Determining Lot Sizes and Schedules Using Power-of-Two Policy

2007 ◽  
Vol 2007 ◽  
pp. 1-18
Author(s):  
Esra Ekinci ◽  
Arslan M. Ornek
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Flow Shop ◽  
Lot Sizing ◽  
Mixed Integer ◽  
Scheduling Problem ◽  
Binary Integer Programming ◽  
Multistage Manufacturing ◽  
Lot Sizing Problem ◽  
Lot Sizes

We consider the problem of determining realistic and easy-to-schedule lot sizes in a multiproduct, multistage manufacturing environment. We concentrate on a specific type of production, namely, flow shop type production. The model developed consists of two parts, lot sizing problem and scheduling problem. In lot sizing problem, we employ binary integer programming and determine reorder intervals for each product using power-of-two policy. In the second part, using the results obtained of the lot sizing problem, we employ mixed integer programming to determine schedules for a multiproduct, multistage case with multiple machines in each stage. Finally, we provide a numerical example and compare the results with similar methods found in practice.

Single Item Lot Sizing Models with Bounded Inventory and Remanufacturing

2010 ◽  
Vol 102-104 ◽  
pp. 791-795
Author(s):  
Neng Min Wang ◽  
Zheng Wen He ◽  
Qiu Shuang Zhang ◽  
Lin Yan Sun
Keyword(s):  
Lot Sizing ◽  
Dynamic Programming Algorithm ◽  
Production Capacity ◽  
Planning Horizon ◽  
Programming Algorithm ◽  
Single Item ◽  
Time Dynamic ◽  
Lot Sizing Problem ◽  
Dynamic Lot Sizing ◽  
Finite Planning Horizon

Dynamic lot sizing problem for systems with bounded inventory and remanufacturing was addressed. The demand and return amounts are deterministic over the finite planning horizon. Demands can be satisfied by manufactured new items, but also by remanufactured returned items. In production planning, there can be situations where the ability to meet customer demands is constrained by inventory capacity rather than production capacity. Two different limited inventory capacities are considered; there is either bounded serviceables inventory or bounded returns inventory. For the two inventory case, we present exact, polynomial time dynamic programming algorithm based on the idea of Teunter R, et al. (2006).

Sign in / Sign up

Export Citation Format

Share Document