934 research outputs found

    Framework for sustainable TVET-Teacher Education Program in Malaysia Public Universities

    Get PDF
    Studies had stated that less attention was given to the education aspect, such as teaching and learning in planning for improving the TVET system. Due to the 21st Century context, the current paradigm of teaching for the TVET educators also has been reported to be fatal and need to be shifted. All these disadvantages reported hindering the country from achieving the 5th strategy in the Strategic Plan for Vocational Education Transformation to transform TVET system as a whole. Therefore, this study aims to develop a framework for sustainable TVET Teacher Education program in Malaysia. This study had adopted an Exploratory Sequential Mix-Method design, which involves a semi-structured interview (phase one) and survey method (phase two). Nine experts had involved in phase one chosen by using Purposive Sampling Technique. As in phase two, 118 TVET-TE program lecturers were selected as the survey sample chosen through random sampling method. After data analysis in phase one (thematic analysis) and phase two (Principal Component Analysis), eight domains and 22 elements have been identified for the framework for sustainable TVET-TE program in Malaysia. This framework was identified to embed the elements of 21st Century Education, thus filling the gap in this research. The research findings also indicate that the developed framework was unidimensional and valid for the development and research regarding TVET-TE program in Malaysia. Lastly, it is in the hope that this research can be a guide for the nations in producing a quality TVET teacher in the future

    Survey of dynamic scheduling in manufacturing systems

    Get PDF

    Satellite downlink scheduling problem: A case study

    Get PDF
    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 Classification of Hyper-heuristic Approaches

    Get PDF
    The current state of the art in hyper-heuristic research comprises a set of approaches that share the common goal of automating the design and adaptation of heuristic methods to solve hard computational search problems. The main goal is to produce more generally applicable search methodologies. In this chapter we present and overview of previous categorisations of hyper-heuristics and provide a unified classification and definition which captures the work that is being undertaken in this field. We distinguish between two main hyper-heuristic categories: heuristic selection and heuristic generation. Some representative examples of each category are discussed in detail. Our goal is to both clarify the main features of existing techniques and to suggest new directions for hyper-heuristic research

    Comparative Analysis of Metaheuristic Approaches for Makespan Minimization for No Wait Flow Shop Scheduling Problem

    Get PDF
    This paper provides comparative analysis of various metaheuristic approaches for m-machine no wait flow shop scheduling (NWFSS) problem with makespan as an optimality criterion. NWFSS problem is NP hard and brute force method unable to find the solutions so approximate solutions are found with metaheuristic algorithms. The objective is to find out the scheduling sequence of jobs to minimize total completion time. In order to meet the objective criterion, existing metaheuristic techniques viz. Tabu Search (TS), Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) are implemented for small and large sized problems and effectiveness of these techniques are measured with statistical metric
    corecore