Journal of The Chinese Institute of Industrial Engineers 

About: Journal of The Chinese Institute of Industrial Engineers is an academic journal. The journal publishes majorly in the area(s): Job shop scheduling & Supply chain. It has an ISSN identifier of 1017-0669. Over the lifetime, 680 publications have been published receiving 4592 citations.

Critical issues of m-learning: Design models, adoption processes, and future trends

Abstract: E-learning can be broadly defined as content designed for access through electronic communication, such as the Internet, intranets, digital versatile discs, and synchronous and asynchronous modules. M-learning carries the idea of e-learning a step further by adapting its content to handheld devices such as iPods (a digital audio and storage device from Apple Corporation), personal digital assistants, and smartphones. The main objective of m-learning is to provide the learner the ability to assimilate learning anywhere and at any time. The purpose of this article is to establish the state of m-learning in the corporate and education environments, the devices appropriate to m-learning, the advantages and disadvantages associated with m-learning, and the possible future direction of m-learning. Specifically, using the integrative literature review protocol, this article will cover, discuss, and address critical issues of m-learning including definitions, design models, caveats, adoption processes, and future...

Key quality performance evaluation using fuzzy ahp

Abstract: This research proposes an evaluation model that integrates triangular fuzzy numbers and the analytical hierarchy process to develop a fuzzy multiple-attribute decision-making(FMADM) model for key quality-performance evaluation. Using the proposed model, decision-makers can determine, in advance, critical quality elements that might significantly affect quality performance. A practical example of an electronic product has been used to illustrate the theoretical qualitative proposed evaluation model. Results demonstrate that decision-makers can use the flexibility of the proposed model by adjusting the confidence coefficient to express their degree of understangidng with respect to the importance of each component. Moreover, the result of FMADM analysis is a significant contribution to quality improvement.

A survey of algorithms for single and multi-objective unrelated parallel-machine deterministic scheduling problems

Abstract: This paper surveys the literature related to solving traditional unrelated parallel-machine scheduling problems. It compiles algorithms for the makespan, total weighted sum of completion times, maximum tardiness, total tardiness, total earliness and tardiness, and multiple criteria performance measures. The review of the existing algorithms is restricted to the deterministic problems without setups, preemptions, or side conditions on the problem. Even for such traditional problems, this survey reveals that while makespan minimization has been fairly widely studied, problems that include processing characteristics such as release times, sequence dependent setups, and preemptions remain largely unstudied. Research in solving unrelated parallel-machine scheduling problems involving the minimization of the number of tardy jobs, weighted number of tardy jobs, total tardiness, and total weighted tardiness is quite limited.

Acceptance sampling plans from truncated life tests based on the Burr type XII percentiles

Abstract: In this article, acceptance sampling plans are developed for the Burr type XII distribution percentiles when the life test is truncated at a pre-specified time. The minimum sample size necessary to ensure the specified life percentile is obtained under a given customer's risk. The operating characteristic values (tables) of the sampling plans as well as producer's risk are presented. The R package named spBurr is developed to implement the sampling plans. Two real datasets regarding the oil breakdown of an insulating fluid under high test voltage and the first failure times of small electric carts used for internal transportation and delivery are given as illustration.

An improved ant colony system algorithm for the vehicle routing problem

Abstract: The vehicle routing problem (VRP), a well-known combinatorial optimization problem, holds a central place in logistics management. Many meta-heuristic approaches like Simulated Annealing (SA), Genetic Algorithms (GA), Tabu Search (TS), and Ant Colony Optimization (ACO) have been proposed to solve VRP. Ant Algorithm is a distributed meta-heuristic approach that has been applied to various combinatorial optimization problems, including traveling salesman problem, quadratic assignment problem. In this research, we proposed an improved ant colony system (IACS) algorithm that possesses a new state transition rule, a new pheromone updating rule and diverse local search approaches. The computational results on 14 VRP benchmark problems show that our IACS yields better solutions than those of other ant algorithms in the literature and is competitive with other meta-heuristic approaches in terms of solution quality.