MIP-Based Heuristics for Capacitated Lot-Sizing with Sequence-Dependent Setups and Substitutions

2009 ◽  
pp. 151-183
Author(s):  
J. Christian Lang
Keyword(s):  
Lot Sizing ◽  
Sequence Dependent ◽  
Capacitated Lot Sizing

scholarly journals Study on column generation for the lot-sizing and scheduling problem with sequencedependent setup time

2018 ◽  
Vol 189 ◽  
pp. 06002
Author(s):  
Dandan Zhang ◽  
Canrong Zhang
Keyword(s):  
Lot Sizing ◽  
Setup Time ◽  
Mixed Integer ◽  
Scheduling Problem ◽  
Optimal Solutions ◽  
Sequence Dependent ◽  
Sequence Dependent Setup Time ◽  
Capacitated Lot Sizing ◽  
Sequence Dependent Setup ◽  
Lot Sizing And Scheduling

The capacitated lot-sizing and scheduling problem with sequence-dependent setup time and carryover setup state is a challenge problem in the semiconductor assembly and test manufacturing. For the problem, a new mixed integer programming model is proposed, followed by exploring its relative efficiency in obtaining optimal solutions and linearly relaxed optimal solutions. On account of the sequence-dependent setup time and the carryover of setup states, a per-machine Danzig Wolfe decomposition is proposed. We then build a statistical estimation model to describe correlation between the optimal solutions and two lower bounds including the linear relaxation solutions, and the pricing sub-problem solutions of Danzig Wolfe decomposition, which gives insight on the optimal values about information regarding whether or not the setup variables in the optimal solution take the value of 1, and the information is further used in the branch and select procedure. Numerical experiments are conducted to test the performance of the algorithm.

scholarly journals Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups

2010 ◽  
Vol 14 (2) ◽  
pp. 209-219 ◽  
Author(s):  
António Aroso Menezes ◽  
Alistair Clark ◽  
Bernardo Almada-Lobo
Keyword(s):  
Lot Sizing ◽  
Sequence Dependent ◽  
Capacitated Lot Sizing ◽  
Lot Sizing And Scheduling

scholarly journals Capacitated Lot-Sizing Problem with Sequence-Dependent Setup, Setup Carryover and Setup Crossover

Processes ◽  
2020 ◽  
Vol 8 (7) ◽  
pp. 785
Author(s):  
Jangha Kang
Keyword(s):  
Lot Sizing ◽  
Building Blocks ◽  
Mixed Integer ◽  
Efficient Production ◽  
Arbitrary Length ◽  
Sequence Dependent ◽  
Lot Sizing Problem ◽  
Capacitated Lot Sizing ◽  
Sequence Dependent Setup ◽  
Setup Variables

Since setup operations have significant impacts on production environments, the capacitated lot-sizing problem considering arbitrary length of setup times helps to develop flexible and efficient production plans. This study discusses a capacitated lot-sizing problem with sequence-dependent setup, setup carryover and setup crossover. A new mixed integer programming formulation is proposed. The formulation is based on three building blocks: the facility location extended formulation; the setup variables with indices for the starting and the completion time periods; and exponential number of generalized subtour elimination constraints (GSECs). A separation routine is adopted to generate the violated GSECs. Computational experiments show that the proposed formulation outperforms models from the literature.

scholarly journals Single machine multi-product capacitated lot sizing with sequence-dependent setups

2007 ◽  
Vol 45 (20) ◽  
pp. 4873-4894 ◽  
Author(s):  
Bernardo Almada-lobo ◽  
Diego Klabjan ◽  
Maria Antónia carravilla ◽  
José F. Oliveira
Keyword(s):  
Single Machine ◽  
Lot Sizing ◽  
Sequence Dependent ◽  
Capacitated Lot Sizing
Sign in / Sign up

Export Citation Format

Share Document