A survey of scheduling problems with setup times or costs

Author name used in this publication: C. T. NgAuthor name used in this publication: T. C. E. Cheng2007-2008 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

Bicriteria scheduling of a two-machine flowshop with sequence-dependent setup times

The official published version of the article can be found at the link below.A two-machine flowshop scheduling problem is addressed to minimize setups and makespan where each job is characterized by a pair of attributes that entail setups on each machine. The setup times are sequence-dependent on both machines. It is shown that these objectives conflict, so the Pareto optimization approach is considered. The scheduling problems considering either of these objectives are NP-hard , so exact optimization techniques are impractical for large-sized problems. We propose two multi-objective metaheurisctics based on genetic algorithms (MOGA) and simulated annealing (MOSA) to find approximations of Pareto-optimal sets. The performances of these approaches are compared with lower bounds for small problems. In larger problems, performance of the proposed algorithms are compared with each other. Experimentations revealed that both algorithms perform very similar on small problems. Moreover, it was observed that MOGA outperforms MOSA in terms of the quality of solutions on larger problems.Partial Funding from EPSRC under grant EP/D050863/1

Efficient heuristics for the parallel blocking flow shop scheduling problem

We consider the NP-hard problem of scheduling n jobs in F identical parallel flow shops, each consisting of a series of m machines, and doing so with a blocking constraint. The applied criterion is to minimize the makespan, i.e., the maximum completion time of all the jobs in F flow shops (lines). The Parallel Flow Shop Scheduling Problem (PFSP) is conceptually similar to another problem known in the literature as the Distributed Permutation Flow Shop Scheduling Problem (DPFSP), which allows modeling the scheduling process in companies with more than one factory, each factory with a flow shop configuration. Therefore, the proposed methods can solve the scheduling problem under the blocking constraint in both situations, which, to the best of our knowledge, has not been studied previously. In this paper, we propose a mathematical model along with some constructive and improvement heuristics to solve the parallel blocking flow shop problem (PBFSP) and thus minimize the maximum completion time among lines. The proposed constructive procedures use two approaches that are totally different from those proposed in the literature. These methods are used as initial solution procedures of an iterated local search (ILS) and an iterated greedy algorithm (IGA), both of which are combined with a variable neighborhood search (VNS). The proposed constructive procedure and the improved methods take into account the characteristics of the problem. The computational evaluation demonstrates that both of them –especially the IGA– perform considerably better than those algorithms adapted from the DPFSP literature.Peer ReviewedPostprint (author's final draft

Assessing the factors of green computing adoption among manufacturing employees: an analysis of the electrical and electronic sector

Recent trends and heavy uses of IT products and electronic gadgets have led to a proliferation of green computing studies because these wastes are not biodegradable. A significant amount of previous studies has been performed on green computing at the organizational level with most studies tend to focus on developed countries. The present study examined numerically the most influential factor towards the employees’ intention to adopt green computing and measure the intention level of employees in green computing adoption. The current study explored five adoption factors with five hypotheses have been established. These hypotheses were theorized from Theory of Planned Behaviour with emphasis on environmental concern. Previous studies from Malaysia context have primarily concentrated on green computing in education sector compared to manufacturing sector. Hence the study was conducted at electrical and electronic industries located at southern Malaysia. Questionnaires were purposely distributed to 250 respondents, however only 110 responses were valid that yielded response rate of 56%. Respondents are among the employees in IT and administration department that equipped with ICT application. The finding verifies the most influential factor affecting green computing adoption is environmental concern with 43.8%. All factors were proved to have positive correlation to the green computing intention. This correlation is related to the high intention level of employees in practicing green computing due to headquarters initiatives and the conditions set by the importing countries. Social norms have less impact towards behavioral intention to practice green computing that manifested by the low correlation percentage. The current study contributes to our knowledge on the green computing intention among manufacturing employees in Malaysia besides the implications of the results and future research directions. This study will help the policy makers in promoting environmental awareness among users of computing devices

A linear programming-based method for job shop scheduling

We present a decomposition heuristic for a large class of job shop scheduling problems. This heuristic utilizes information from the linear programming formulation of the associated optimal timing problem to solve subproblems, can be used for any objective function whose associated optimal timing problem can be expressed as a linear program (LP), and is particularly effective for objectives that include a component that is a function of individual operation completion times. Using the proposed heuristic framework, we address job shop scheduling problems with a variety of objectives where intermediate holding costs need to be explicitly considered. In computational testing, we demonstrate the performance of our proposed solution approach

Microalgae production and maintenance optimization via mixed-integer model predictive control

This paper studies the joint production and maintenance scheduling in microalgae manufacturing systems comprised of multiple machines, which are subject to coupled production demand agreements and operational maintenance constraints. Namely, there are some microalgae production demands to be met over a given horizon, and the maintenance of each microalgae manufacturing unit must be done before a given deadline. Moreover, the number of units whose maintenance can be done simultaneously over the same day is limited, and the units that undergo maintenance cannot contribute to microalgae production during their maintenance day. To solve the considered problem, we design a mixed-integer nonlinear model predictive controller, which is implemented in two optimization stages. The former regards a mixed-integer model predictive control problem, while the latter considers a nonlinear model predictive control problem. The proposed approach allows us to decouple the mixed-integer and nonlinear parts of the whole problem, and thus provides more flexibility on the optimization solvers that can be employed. In addition, the first stage also evaluates the attainability of the demand agreements, and provides a mechanism to minimally adjust such constraints so that their satisfaction can be guaranteed at the second stage. The overall model predictive control approach is based on experimental data collected at VAXA Technologies Ltd., and the effectiveness of the proposed method is validated through numerical simulations including multiple manufacturing units and uncertainties.Juan Martinez-Piazuelo gratefully acknowledges the Universitat Politècnica de Catalunya and Banco Santander for the financial support of his predoctoral grant FPI-UPC. In addition, the authors would like to thank VAXA Technologies Ltd. as well as the project PID2020-115905RB-C21 (L-BEST) funded by MCIN/ AEI /10.13039/501100011033 for supporting this research.Peer ReviewedPostprint (published version

Production and inventory control in complex production systems using approximate dynamic programming.

Production systems focus not only on providing enough product to supply the market, but also on delivering the right product at the right price, while lowering the cost during the production process. The dynamics and uncertainties of modern production systems and the requirements of fast response often make its design and operation very complex. Thus, analytical models, such as those involving the use of dynamic programming, may fail to generate an optimal control policy for modern production systems. Modern production systems are often in possession of the features that allow them to produce various types of product through multiple working stations interacting with each other. The production process is usually divided into several stages, thus a number of intermediate components (WIP) are made to stock and wait to be handled by the next production stage. In particular, development of an efficient production and inventory control policy for such production systems is difficult, since the uncertain demand, system dynamics and large changeover times at the work stations cause significant problems. Also, due to the large state and action space, the controlling problems of modern production systems often suffer from the curse of dimensionality