62 research outputs found
Satellite downlink scheduling problem: A case study
The synthetic aperture radar (SAR) technology enables satellites to
efficiently acquire high quality images of the Earth surface. This generates
significant communication traffic from the satellite to the ground stations,
and, thus, image downlinking often becomes the bottleneck in the efficiency of
the whole system. In this paper we address the downlink scheduling problem for
Canada's Earth observing SAR satellite, RADARSAT-2. Being an applied problem,
downlink scheduling is characterised with a number of constraints that make it
difficult not only to optimise the schedule but even to produce a feasible
solution. We propose a fast schedule generation procedure that abstracts the
problem specific constraints and provides a simple interface to optimisation
algorithms. By comparing empirically several standard meta-heuristics applied
to the problem, we select the most suitable one and show that it is clearly
superior to the approach currently in use.Comment: 23 page
A mixed integer program for cyclic scheduling of flexible flow lines
A new mixed integer programming formulation is presented for cyclic scheduling in flow lines with parallel machines and finite in-process buffers, where a Minimal Part Set (MPS) in the same proportion as the overall production target is repetitively scheduled. The cycle of parts in an MPS is not determined a priori, but is obtained along with the optimal schedule for all parts. In addition to the cyclic scheduling, a cyclic-batch scheduling mode is introduced, where within the MPS the parts of one type are processed consecutively. Numerical examples are included and some results of computational experiments are reported
A note on the Miller-Tucker-Zemlin model for the asymmetric traveling salesman problem
An enhancement of the Miller-Tucker-Zemlin (MTZ) model for the asymmetric traveling salesman problem is presented by introducing additional constraints to the initial formulation. The constraints account for ordering of boundary nodes as well as all successive nodes in the salesman tour. The enhanced MTZ subtour elimination constraints are computationally compared with the basic MTZ constraints and the version of MTZ lifted by Desrochers and Laporte. The proposed enhancement shows improved performance on a number of asymmetric TSPLIB instances
- …