A semi-infinite programming model for earliness/tardiness production planning with simulated annealing

Authors:
Y Li;D Wang
Affiliations:
Department of Automatic Control, Northeastern University Shenyang, 110006, P.R. China;Department of Automatic Control, Northeastern University Shenyang, 110006, P.R. China
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1997

Citing 4
Cited 3

Convergence of an annealing algorithm

Mathematical Programming: Series A and B
Minimizing mean squared deviation of completion times about a common due date

Management Science
Semi-infinite programming: theory, methods, and applications

SIAM Review
Earliness/tardiness production planning approaches for manufacturing systems

Computers and Industrial Engineering - Collection of papers on Computer-Integrated Manufacturing

SIPAMPL: Semi-infinite programming with AMPL

ACM Transactions on Mathematical Software (TOMS)
Solving semi-infinite programming problems by using an interface between MATLAB and SIPAMPL

SMO'06 Proceedings of the 6th WSEAS International Conference on Simulation, Modelling and Optimization
An immune-genetic algorithm for introduction planning of new products

Computers and Industrial Engineering

Quantified Score

Hi-index	0.98

Visualization

Abstract

To describe the earliness/tardiness production planning problems in the JIT environment, a nonlinear semi-infinite programming model was proposed in [1]. Due to a nonconvex objective function and infinitely many constraints, the model is difficult to solve by traditional methods. In this paper, simulated annealing method combined with a heuristic and the steepest descent method is developed. Numerical results shows that the present approach is very efficient. In theory, the developed method is an attempt to solve a continuous domain problem by simulated annealing.