Showing papers in "Computers & Industrial Engineering in 2001"

TL;DR: In this article, the authors present the concepts, applications, and perspectives of Design for X (DFX) in manufacturing, thus providing some guidelines and references for future research and implementation.

TL;DR: In this paper, an efficient assignment procedure is developed for two-sided assembly line balancing problems, where a special emphasis is placed on maximizing work relatedness and maximizing work slackness.

TL;DR: In this paper, a GA metaheuristic based cell formation procedure is presented to simultaneously group machines and part-families into cells, so that intercellular movements are minimized.

TL;DR: In this article, a stochastic integer programming (SIP) approach is presented for simultaneous selection of tolerances and suppliers based on the quality loss function and process capability indices, and a direct link between the minimum manufacturing cost and the required level of manufacturing yield is established through the process capability index.

TL;DR: A kind of hybrid heuristic GA is proposed for problem n/m/G/Cmax, where the scheduling rules are integrated into the process of genetic evolution and the neighborhood search technique is adopted as an auxiliary procedure to improve the solution performance.

TL;DR: In this article, a branch and bound procedure for batch processors with incompatible job families is presented. But the problem of scheduling batch processors is different from the one we consider in this paper, in that jobs in a given family have identical job processing times, arbitrary job weights, and arbitrary job sizes.

TL;DR: In this paper, a genetic algorithm and a simulated annealing approach were applied to the two-dimensional non-guillotine cutting stock problem and carried out experimentation on several test cases.

TL;DR: In this paper, a modified dispatching approach that combines multiple dispatching criteria into a single rule with the objective of simultaneously optimizing multiple objectives is proposed for the scheduling problem of semiconductor manufacturing systems.

TL;DR: This paper compares the Hooke–Jeeves pattern search, Nelder–Mead simplex, simulated annealing, and genetic algorithm optimization algorithms on variations of four industrial case study simulation problems.

TL;DR: In this article, an optimal mix strategy was proposed for e-commerce retailers to maximize the expected profit and maximize the probability of achieving a target profit under uniform, exponential, and normal demand distributions.

TL;DR: In this paper, the authors model the production-inventory system as a Markov chain and develop an efficient algorithm to compute the potentials that are used to formulate the cost function, which is then compared to simulation results where time is treated as a continuous parameter.

TL;DR: In this article, a hybrid optimization approach is presented for the layout design of unequal-area facilities, where simulated annealing is used to optimize a randomly generated initial placement on an "extended plane" considering the unequal area facilities enclosed in magnified envelop blocks, and an analytical method is applied to obtain the optimum placement of each envelop block in the direction of steepest descent.

TL;DR: A hybrid approach involving neural networks and genetic algorithm (GA) is presented to solve the expanded job-shop scheduling problem (EJSSP) and it is shown that the hybrid approach is powerful for complex EJSSP.

TL;DR: In this paper, the Weibull process is used to model the life cycle of a jet engine and the removal characteristics are estimated by collecting actual field data based on the engine age and operating environment.

TL;DR: In this paper, the average voids value (AVV) is calculated to indicate the average number of newly produced voids when a pair of machine groups are combined, which is very simple, intuitively appealing, and overcomes many disadvantages inherent in some traditional SCM-based approaches.

TL;DR: In this article, the authors presented a technique to obtain production sequences where scheduling flexibility and number of setups are considered, and the authors constructed an efficient frontier via the popular search heuristics of genetic algorithms, simulated annealing and Tabu search.

TL;DR: In this article, the configuration of machine cells in the presence of alternative routings for part types is studied and an efficient Tabu Search (TS) algorithm is proposed to solve this problem.

TL;DR: In this article, the authors investigated the buffer allocation problem in short unbalanced production lines consisting of up to six machines that are subject to breakdowns and developed an algorithm based on the sectioning (segmentation) approach to solve the problem.

TL;DR: In this article, the authors assume that the backorder rate is dependent on the length of lead time through the amount of shortages and develop an algorithm to find the optimal ordering strategy.

TL;DR: This research provides a methodology to approach automation introduction evaluation in a hospital environment and shows with a high overall confidence that a fleet of mobile robots can achieve better final results than a human-based transportation system according to a representative preference structure formulated by a hospital manager.

TL;DR: In this paper schedule control policies are created to minimize transfer time under stochastic conditions and it is shown there exists at most one non-boundary local minimum point for the special case where arrival times of connecting buses are identically and normally distributed.

TL;DR: In this paper, a new production planning and scheduling framework is developed to address the multi-stage, production-inventory system problem by integrating Material Requirements Planning (MRP) and Just-in-Time (JIT) production.

TL;DR: In this article, the authors propose a new model for quoting due dates in a make-to-order environment where customers request due dates, and the model incorporates inventory costs, fill rate issues, and service level issues.

TL;DR: In this paper, a new lower bound that is used to evaluate nodes in a branch and bound procedure for the flow shop group scheduling problem is presented. This lower bound is compared to the one developed by [CIRP Annals, 25 (1976) 419] and tested on small randomly generated problems.

TL;DR: In this paper, a modified mixture inventory model with backorders and lost sales, in which the order quantity, the reorder point and the lead time are decision variables, was derived, and an algorithm procedure was developed to obtain the optimal ordering strategy.

TL;DR: In this paper, the authors describe the techniques used in developing a three-dimensional (3D) automated inspection system for surface mount devices (SMDs) and explore four different inspection approaches.

TL;DR: In this paper, a framework based on the IDEF methodology, stream analysis approach, and dynamic simulation for process analysis and reengineering is presented, which is used for analysis, diagnosis, and management of process changes represented with an IDEF model.

TL;DR: In this article, a tabu search based heuristic, PM_TABU, is proposed for preventive maintenance (PM) scheduling problem, which aims to maximize the total priority of the scheduled tasks subject to resource availability constraints.

TL;DR: A six-step methodology for data mining is presented and steps from the methodology are applied in a case study to develop a GA-Based system for intelligent knowledge discovery for machine diagnosis.

TL;DR: In this article, a scheduling system for thin-film transistor liquid crystal display (TFT LCD) assembly process is presented, where two scheduling heuristics are proposed for each production step of assembly process.