Efficient Heuristics for MRP Lot Sizing with Variable Production/Purchasing Costs*

Two heuristics based on branch and bound (B&B) are developed to solve closed-loop material requirements planning (MRP) lot-sizing problems that have general product structures and variable costs. A “look ahead method'’(LAM) heuristic allows for variable production/purchasing costs and uses a single-level B&B procedure to rapidly improve lower bound values; thus, LAM efficiently uses computer-storage capacity and allows solution of larger problems. The “total average modification'’(TAM) heuristic uses B&B, applied level by level, and modified setup and carrying costs to solve the variable production/purchasing costs MRP lot-sizing problem. LAM and TAM are tested on problems and compared to heuristics in the literature. TAM may be used to solve large MRP lot-sizing problems encountered in practice.     

On the Joint Lot-Sizing Problem with Zero Setup Costs

In a recent paper, Pinto and Mabert [5] presented a lot-sizing rule and an improvement procedure for the joint lot-sizing problem with zero setup costs. We show that this procedure often yields infeasible schedules. We also present and discuss two interesting properties of the joint lot-sizing problem with zero setup costs. A numerical example to illustrate the second property is provided.     

INSTRUCTING OPERATIONS DESIGN: AN EXPERIENTIAL APPROACH

Teaching an operations design course has major pedagogical challenges. (1) The design topics—output, process, facility, and work design—are necessarily taught sequentially, yet the decisions are integrative. (2) Instruction must be generic to service or product producers. (3) Discussing output design is difficult since students typically have had no exposure to the “product language” of engineering graphics. (4) No text is available which examines in sufficient depth all the operations design decisions. (5) Cases necessarily depict historical situations—process technologies and economic data—while operations managers must plan future directions for their productive systems. (6) While the commercial world contains fresh information and data, students are inexperienced in obtaining knowledge from the real world. (7) While the course presents an operations management perspective, students must recognize the information, data, and cooperation necessary from the other functional areas to successfully complete the operations design. To help overcome these seven pedagogical challenges, the students in the undergraduate and graduate operation design courses complete a comprehensive feasibility study for a new product or service and the entire productive system.     

IMPLICIT OPTIMAL AND HEURISTIC LABOR STAFFING IN A MULTIOBJECTIVE,MULTILOCATION ENVIRONMENT*

This paper presents a tractable set of integer programming models for the days-off scheduling of a mix of full- and part-time employees working α to β days/week (cycle) in a multiple-objective, multiple-location environment. Previous models were formulated to specifically schedule part-time employees working either two or three days per week. These models were intractable because they required complete employee schedule information. The new models are deemed implicit optimal since they are required to supply only essential information. While the number of variables in previous models is an exponential increasing function of β-α, the size of three of the new models is independent of α and β. The first three models developed here (as in [18]) deal with the trade-offs between idle time, the number of employees required to work at multiple “locations,” and the size of the total labor pool. The inherent flexibility of the implicit modeling approach is illustrated by the presentation of various modifications of the basic models. These modifications permit the use of preference weights on the number of employee work days/week (cycle) or the minimization of payroll costs where differential pay rates exist. These latter models may also be formulated such that idle time is ignored, constrained or minimized. The execution time for the implicit models (on a CDC CYBER 730 computer with commercially available software) averaged well under five seconds on 1200 trial problems for the type of application considered in [18]. A solution was obtained in less than 46 seconds of CPU time for a trial problem which would have required over 1.4 million integer variables with previous models. The availability of optimal solutions was invaluable in the development of two heuristics designed to deal with the trade-offs of [16]. In an experimental analysis a previous heuristic produced results which averaged from 74 to 508 percent above optimum across six experimental conditions. The comparable new heuristic produced results which averaged from 3 to 8 percent above optimum for the same experimental conditions. The paper concludes by developing a framework to integrate the results of this research with the tour scheduling problem and by identifying several other areas for related research.     

SCHEDULING PARALLEL PROCESSORS WITH SETUP COSTS AND RESOURCE LIMITATIONS

An integer linear programming model is presented for the scheduling of n products on m identical machines. The particular problem studied is one that occurs frequently in the fiberglass and textile industries. The model incorporates setup costs, lost production costs, and overtime costs. Due to the structure of the model, integer solutions can be obtained by explicitly restricting only a small number of the integer variables. This allows those responsible for scheduling to solve realistically sized problems in an efficient manner. Computational results are provided for a set of generated test problems.     

Open Order Rescheduling in Job Shops with Demand Uncertainty: A Simulation Study

This paper addresses the problem of open order rescheduling in a job shop. Results are reported of experiments conducted in a simulation model of an 8-machine job shop. Four different order updating policies are examined. The due-date process is modeled to include several realistic features about the pattern of due-date variability. These features are parameterized and tested at several levels. Tardiness results indicate that open order rescheduling is beneficial only when allowances are loosely set. The results indicate that inventory performance is improved by order rescheduling, particularly in cases when due dates are revised to earlier times than originally forecast.     

Order Promising and the Master Production Schedule*

Previous research on material requirements planning (MRP) systems has rarely considered the impact of the master production scheduling method used to promise customer orders and to allocate production capacity. Based on a simulation study of an MRP environment, we show that the correct selection of a master production schedule (MPS) method depends on the variance of end-item demand. In addition, we find evidence that the effectiveness of a particular MPS method can be enhanced by holding buffer inventory at the same level in the product structure as in the MPS.     

国企改革中MBO的实践及思考

在我国各地深化国有企业产权制度改革的实践中,管理层收购(MBO)被付诸大胆的尝试。尽管市场机制不完善、法律环境欠缺,MBO仍由默默无闻的个别行动发展而成近年大规模涌现、并引发理论界、政府及公众热切关注和争论不休的态势。     

浅议高校暂付款的管理

由于财务制度不健全、执行不力及法律意识的缺乏等原因,许多高校财务管理中暂付款的管理与核算存在漏洞。结合实际就暂付款的形成从个人往来、单位往来和内部往来三个方面做了分析,对其管理和使用从各个环节和强化制度建设、经费归口管理催报清理和加强会计电算化与财务管理网络化建设等方面提出建议。     

当前高等学校教师业务档案管理的思考

高校教师业务档案是高校重要的信息资源 ,对加强高校管理 ,提高办学质量 ,深化高校教学改革都起着重要的作用。为此 ,加强高校教师业务档案管理工作十分必要 ,其管理措施应是 :高校应加强对档案工作的领导和管理 ;明确责任、规范管理机构 ;制定收集方案 ;确定内容进行科学的分类、整理 ;合理组卷、排列。