One of the main problems of machining of moulds is the need for an effective monitoring system of wear of cutting tools. This paper presents the results of coordinate measurements of a cutting tool which were obtained by using the non-contact measuring system based on the ACCURA II coordinate measuring machine equipped with the LineScan laser measuring probe and the Calypso metrology software. Inves-tigations were carried out for several measurement strategies including different measurement resolutions and scanning speeds. The results of the coordinate measurements obtained by using the above-mentioned coordinate measuring system were compared to the reference data measured by means of the InfiniteFocus microscope. The measurement results were analysed by means of two software packages: Focus Inspection and Zeiss Reverse Engineering. The point clouds measured by using the LineScan probe were characterized by the selected deviation statistics equal to 4-6 μm when a good match between measurement points and the reference data was obtained. Moreover, these statistics mainly depend on the measurement resolution. The results of the performed experimental research allowed for drawing conclusions concerning the significance of the effect of the adopted measurement strategies on the results of the non-contact coordinate measurements of the selected cutting tool. The application of the non-contact coordinate measurements to the above-mentioned measurement task may contribute to the development of regeneration methods for cutting tools applied for mould manufacturing.

We consider the real-life problem of planning tasks for teams in a corporation, in conditions of some restrictions. The problem takes into account various constraints, such as for instance flexible working hours, common meeting periods, time set aside for self-learning, lunchtimes and periodic performance of tasks. Additionally, only a part of the team may participate in meetings, and each team member may have their own periodic tasks such as self-development. We propose an algorithm that is an extension of the algorithm dedicated for scheduling on parallel unrelated processors with the makespan criterion. Our approach assumes that each task can be defined by a subset of employees or an entire team. However, each worker is of a different efficiency, so task completion times may differ. Moreover, the tasks are prioritized. The problem is NP-hard. Numerical experiments cover benchmarks with 10 instances of 100 tasks assigned to a 5-person team. For all instances, various algorithms such as branch-and-bound, genetic and tabu search have been tested.