Search

Scheduling jobs in a no-wait flow shop with the objective of minimising total earliness and tardiness is the problem addressed in this paper. Idle time may be needed on the first machine due to the no-wait restriction. A model is developed that shows additional idle can be inserted on the first machine to help reduce earliness. Several dispatching heuristics previously used in other environments were modified and tested. A two-phased procedure was also developed, estimating additional idle in the first phase, and applying dispatching heuristics in the second phase. Several versions of an insertion improvement procedure were also developed. The procedures are tested on instances of various sizes and due date tightness and range. The results show the two-phase heuristics are more effective than the simple rules, and the insertion search improvement procedure can provide considerable improvements. [ABSTRACT FROM AUTHOR]

Peer Observation of Teaching has raised a lot of interest as a device for quality enhancement of teaching. While much research has focused on its models, implementation schemes and feedback to the observed, little attention has been paid to what the observer actually sees and can learn from the observation. A multidisciplinary peer observation of teaching program is described, and its data is used to identify the pedagogical aspects to which lecturers pay more attention to when observing classes. The discussion addresses the valuable learning opportunities for observers provided by this program, as well as its usefulness in disseminating, sharing and clarifying quality teaching practices. The need for further research concerning teacher-student relationships and students' engagement is also suggested.

In this paper, we present greedy randomised dispatching heuristics for the single-machine scheduling problem with quadratic earliness and tardiness costs and no machine idle time. The several heuristic versions differ, on the one hand, on the strategies involved in the construction of the greedy randomised schedules. On the other hand, these versions also differ on whether they employ only a final improvement step or perform a local search after each greedy randomised construction. The proposed heuristics were compared with existing procedures as well as with optimum solutions for some instance sizes. The computational results show that the proposed procedures clearly outperform their underlying dispatching heuristic, and the best of these procedures provide results that are quite close to the optimum. The best of the proposed algorithms is the new recommended heuristic for large instances as well as a suitable alternative to the best existing procedure for the larger of the middle-sized instances. [ABSTRACT FROM AUTHOR]