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

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

Flowshop scheduling problems with due date related objectives: A review of the literature

3rd International Conference on Industrial Engineering and Industrial Management XIII Congreso de Ingeniería de Organización Barcelona-Terrassa, September 2nd-4th 200

A study of maintenance contribution to joint production and preventive maintenance scheduling problems in the robustness framework.

International audienceIn this paper, we deal with a joint production and Preventive Maintenance (PM) scheduling problem in the robustness framework. The contributions of this paper are twofold. First, we will establish that the insertion of maintenance activities during production scheduling can hedge against some changes in the shop environment. Furthermore, we will check if respecting the optimal intervals of maintenance activities guarantees a minimal robustness threshold. Then, we will try to identify from the used optimisation criteria those that allow making predictive schedules more robust. The computational experiments in a flowshop show that joint production and PM schedules are more robust than production schedules and maintenance provides an acceptable tradeoff between equipment reliability and performance loss under disruption

A tabu search algorithm for scheduling a single robot in a job-shop environment

We consider a single-machine scheduling problem which arises as a subproblem in a job-shop environment where the jobs have to be transported between the machines by a single transport robot. The robot scheduling problem may be regarded as a generalization of the travelling-salesman problem with time windows, where additionally generalized precedence constraints have to be respected. The objective is to determine a sequence of all nodes and corresponding starting times in the given time windows in such a way that all generalized precedence relations are respected and the sum of all travelling and waiting times is minimized. We present a local search algorithm for this problem where an appropriate neighborhood structure is defined using problem-specific properties. In order to make the search process more efficient, we apply some techniques which accelerate the evaluation of the solutions in the proposed neighbourhood considerably. Computational results are presented for test data arising from job-shop instances with a single transport robot

Ant colony optimization for resource-constrained project scheduling

An ant colony optimization (ACO) approach for the resource-constrained project scheduling problem (RCPSP) is presented. Several new features that are interesting for ACO in general are proposed and evaluated. In particular, the use of a combination of two pheromone evaluation methods by the ants to find new solutions, a change of the influence of the heuristic on the decisions of the ants during the run of the algorithm, and the option that an elitist ant forgets the best-found solution are studied. We tested the ACO algorithm on a set of large benchmark problems from the Project Scheduling Library. Compared to several other heuristics for the RCPSP, including genetic algorithms, simulated annealing, tabu search, and different sampling methods, our algorithm performed best on average. For nearly one-third of all benchmark problems, which were not known to be solved optimally before, the algorithm was able to find new best solutions

Game theoretic approaches to parallel machine scheduling

Tesis (Ingeniero Industrial)En un problema de programación de máquinas idénticas en paralelo que persigue minimizar dos criterios en particular, lapso y tiempo de terminación total, un mecanismo basado en la teoría de juegos es propuesto para solucionarlo. Se considera un juego bipersonal no-cooperativo de 2x2 en el que cada jugador busca minimizar alguno de estos criterios que propone el problema de producción. Cada escenario implica que los jugadores jueguen de manera simultanea y busquen minimizar los costos que están relacionados con los criterios a optimizar. El jugador que representa al trabajo tiene la opción de dejar al trabajo en su posición actual o moverlo a una posición previa, buscando minimizar su tiempo de terminación; mientras que el otro jugador, un agente controlador, toma la decisión de dejar al trabajo en la máquina actual o moverlo a otra, esperando balancear la carga de la máquina y minimizar el lapso. Como resultado de una serie de juegos repetidos entre estos agentes, el Frente de Pareto es construido, mostrando un conjunto de soluciones eficientes al problema.Universidad del Norte. Programa de Ingeniería Industrial

Pull control for Job Shop: Holonic Manufacturing System approach using multicriteria decision-making

International audienceFaced with international competition, industrial production increasingly requires implementation conditions which, in some cases, lead to seek new techniques for workshop control. This is the case when it is asked to establish Just in Time management in a Job Shop having the characteristics of working with small series. A new approach for the organization of the ‘control’ function in such a context is presented here. This approach relies on the use of the holonic paradigm on an isoarchic architecture and on a decision-making capacity based on a multicriteria analysis. The various concepts of this approach are addressed first. Then, the multicriteria decision mechanisms that are used are detailed, as well as the implementation and instrumentation phases. The first results that were obtained are presented

Local search Methods to Solve The Sum of Two Objective Functions

In this paper, the problem of sequencing a set of n jobs on single machine was considered to minimize theobjective function. The aim  is to find the optimal or near optimal  solution  (scheduling) for the objective function consists of a  sum  of  total late work and maximum lateness. This problem is strongly NP-hard. Simulated Annealing, Ant colony Algorithm, and usagea hybridization as a tool to solved the problem approximatelywith up to  100000 jobs in a reasonable time 10 minutes