Solving discrete lot-sizing and scheduling by simulated annealing and mixed integer programming

2017 ◽  
Vol 114 ◽  
pp. 235-243 ◽  
Author(s):  
Sara Ceschia ◽  
Luca Di Gaspero ◽  
Andrea Schaerf
Keyword(s):  
Simulated Annealing ◽  
Integer Programming ◽  
Mixed Integer Programming ◽  
Lot Sizing ◽  
Mixed Integer ◽  
Lot Sizing And Scheduling

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.

scholarly journals Modelling Multi-Period Set-up Times in the Proportional Lot-Sizing Problem

2009 ◽  
Vol 3 (2) ◽  
pp. 15-35 ◽  
Author(s):  
Waldemar Kaczmarczyk
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Lot Sizing ◽  
Programming Models ◽  
Mixed Integer ◽  
Lot Sizing Problem ◽  
Set Up

This paper presents new mixed integer programming models for the Proportional Lot-Sizing Problem (PLSP) with set-up times longer than a period. Proposed models explicitly calculate the distribution of times amongst products in periods with a changeover and determine a final period for every set-up operation. Presented results prove that the proposed models are easier to solve using standard MIP methods than already known models.

A comparison of mixed integer programming formulations of the capacitated lot-sizing problem

2017 ◽  
Vol 56 (23) ◽  
pp. 7064-7084 ◽  
Author(s):  
Hakan F. Karagul ◽  
Donald P. Warsing ◽  
Thom J. Hodgson ◽  
Maaz S. Kapadia ◽  
Reha Uzsoy
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Lot Sizing ◽  
Mixed Integer ◽  
Lot Sizing Problem ◽  
Capacitated Lot Sizing
Sign in / Sign up

Export Citation Format

Share Document