A BRANCH AND BOUND PROCEDURE FOR SETUP PROBLEMS IN FLEXIBLE MANUFACTURING SYSTEMS

We address a medium- to short-term production planning problem in a flexible manufacturing environment. First we present a single-machine, mixed integer programming model for part type selection and lot-sizing problems over a T-period planning horizon. Demand for part types changes dynamically through the periods. The objective is to meet the demand for part types during the periods they are demanded. Available machine time and tool magazine capacities are the system constraints in our models. We next extend on the single- machine model to include multiple machines. In addition to part type selection and lotsizing decisions, the extended model also addresses the machine-loading decision. We present exact branch and bound procedures based on linear programming relaxations for the two models. We also report the results of our computational experiments.     

STRATEGIC PRODUCTION COMPETENCE: CONVERGENT,DISCRIMINANT, AND PREDICTIVE VALIDITY

A resource-based construct of manufacturing competence, termed strategic production competence, is examined with respect to its convergent, discriminant, and predictive validity. The construct evaluates manufacturing performance across a comprehensive domain of competitive priorities relative to item importance and performance. Data from an earlier study of furniture firms (n = 65) are used for statistical testing. The results establish the convergent and discriminant validity of strategic production competence and show that it is positively related to business performance.     

CAPACITATED REMANUFACTURING WITH SERVICE LEVEL CONSTRAINTS*

This research examines production planning and control for a remanufacturer that can sell returned items on a graded as‐is basis or remanufacture the returned items. Using a GI/G/1 queuing network, we model the firms decision to remanufacture an optimal product mix over the long run that maximizes profits while maintaining a desired service level. We further use simulation to explore dispatching heuristics that can be used at the shop‐floor level to achieve the desired optimal product mix, while meeting the service level constraint. Our research is grounded in actual practice and the results provide key insights into the decision‐making process required to maximize profits and minimize average flow times for remanufactured products.