engleski

LTO Heuristics for Capacitated Lot Sizing Problem with Sequence Dependent Setups and Overtimes

The wellknown CLSP problem is generalized including sequence dependent setup times and overtimes and modeling it as a quadratic mixed 0-1 integer programming problem called Capacitated Lot Sizing Problem with Sequence Dependent Setups and Overtimes. We develop a heuristics based on Lagrangean relaxation and tabu search for solving the problem. At the end, some computational results are presented.

capacitated lot sizing problem; two machines; capacity limitations; overtimes; sequence dependent setup times; quadratic mixed 0-1 integer programming problem; heuristics; tabu search; Lagrangean relaxation

nije evidentirano