Continuous Nonlinear Programming Techniques to Solve Scheduling Problems

Authors:
Fabio D. Fagundez;Adilson E. Xavier;Joao L. D. Faco
Affiliations:
-;-;Universidade Federal do Rio de Janeiro, Av. Horácio de Macedo, 2030, Centro de Tecnologia, PESC/COPPE, Bloco H, sala H-318, Rio de Janeiro, RJ, Brazil. 2941-914, e-mail: fabio.fagundez@ufrj.b ...
Venue:
Informatica
Year:
2009

Citing 3
Cited 1

SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization

SIAM Journal on Optimization
Job Sequencing with Exponential Functions of Processing Times

Informatica
Multiple Shift Scheduling of Hierarchical Workforce with Multiple Work Centers

Informatica

Optimization and Knowledge-Based Technologies

Informatica

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the most known applications of Discrete Optimization is on scheduling. In contrast, one of the most known applications of Continuous Nonlinear Optimization is on the control of dynamic systems. In this paper, we combine both views, solving scheduling problems as dynamic systems, modeled as discrete-time nonlinear optimal control problems with state and control continuous variables subjected to upper and lower bounds. Complementarity constraints are used to represent scheduling decisions. One example we discuss in detail is the crude oil scheduling in ports, with numerical results presented.