约束多目标选址问题及其算法

文章考察了一类带有区域约束的多目标选址问题，给出了用模拟退火法进行求解的策略，并在微机上予以实现，经试算得到了满意的效果。     

单机排序问题的数学规划表示

本文把单机排序问题1||∑wjCj表述成一个二次规划,并把不带权的问题1||∑Cj进一步转化成指派问题,从而用指派问题的匈牙利算法证明SPT序是问题1||∑Cj的最优解,这个结论似乎很平凡,但对于用数学规划来研究排序问题是一个很有意义的进展,这为我们用二次规划和半定规划来研究NP困难的排序问题的近似算法打下基础。     

较多约束多目标规划的最优性条件

本文研究较多约束多目标规划的最优性条件.借助于所给问题的较多约束集结构表示,定义了较多约束规划问题的较多约束Pareto有效解和较多约束Pareto弱有效解,给出较多约束Pareto有效解和较多约束Pareto弱有效解要满足的Fritz John条件和Kuhn-Tucker条件,最后给出在凸性条件下它的一些最优性充分条件.     

多资源约束下的工序排序的一个准则及算法

在ＰＥＲＴ和ＣＰＭ中，对于资源约束优化的工序排序准则大多数明要用量小时差法。本文提出的多资源约束下新的工序排序准，使工程计划安排满足资源约束，且使总工期尽可能不拖延或拖延最少。     

多属性决策中的目标规划

针对只有部分权重信息的对方案有偏好的多属性决策问题,本文给出了一种简单的目标规划模型,通过对该模型的求解却可得到决策方案的排序。最后给出了一个算例。     

非线性不等式与等式约束的多目标规划问题的区间极大熵方法

利用极大熵方法将带多个非线性不等式约束和多个非线性等式约束的多目标规划问题变为两个非线性不等式约束的单个可微的目标函数优化问题,并结合区间分析知识给出一种新的解决多目标规划问题的区间方法.     

在线约束单机排序问题的启发式算法

由于约束单机排序问题是经典装箱问题的一种推广并且同经典装箱问题有一些相同的特征。本文主要讨论了经典装箱问题的一些启发式算法在在线约束单机排序问题上的推广和最坏界估计。     

多目标规划下的平板折叠桌设计

对于参数确定的创意平板折叠桌,桌腿边缘旋转过程满足相关的曲线方程,利用多目标规划在部分参数未知的情况下,以产品稳固性为目标函数、以加工方便、用材最少为紧约束条件,利用枚举法可寻得木板长宽、钢筋位置、木槽长度以及桌腿数目的最优解.最后在一般模型的基础上,给出数值例子进行实践证明.     

线性等式约束多目标规划的一个降维算法

本文提出具有线性等式约束多目标规划问题的一个降维算法．当目标函数全是二次或线性但至少有一个二次型时，用线性加权法转化原问题为单目标二次规划，再用降维方法转化为求解一个线性方程组．若目标函数非上述情形，首先用线性加权法将原问题转化为具有线性等式约束的非线性规划，然后，对这一非线性规划的目标函数二次逼近，构成线性等式约束二次规划序列，用降维法求解，直到满足精度要求为止．     

复形上一类混合约束的多目标规划问题

探讨了ｎ维复形上一类具有混合约束的多目标规划问题,并运用代数拓扑方法得出这类规划问题的有效解。     

A mixed integer programming model for advanced planning and scheduling (APS)

This paper presents a mixed integer programming (MIP) model which succeeds in a system integration of the production planning and shop floor scheduling problems. The proposed advanced planning and scheduling (APS) model explicitly considers capacity constraints, operation sequences, lead times and due dates in a multi-order environment. The objective of the model is to seek the minimum cost of both production idle time and tardiness or earliness penalty of an order. The output of the model is operation schedules with order starting time and finish time. Numerical result shows that the suggested APS model can favorably produce optimal schedules.     

A note on “A mixed integer programming model for advanced planning and scheduling (APS)”

In a recent paper, Chen and Ji [Chen, K., Ji, P., 2007. A mixed integer programming model for advanced planning and scheduling (APS). European Journal of Operational Research 181, 515–522] develop a mixed integer programming model for advanced planning and scheduling problem that considers capacity constraints and precedence relations between the operations. The orders require processing of several operations on eligible machines. The model presented in the above paper works for the case where each operation can be processed on only one machine. However, machine eligibility means that only a subset of machines are capable of processing a job and this subset may include more than one machine. We provide a general model for advanced planning and scheduling problems with machine eligibility. Our model can be used for problems where there are alternative machines that an operation can be assigned to.     

Coal bank scheduling using a mathematical programming model

Coals are extracted from mines and upgraded on the surface for customers. The upgraded coals must be aged at least four weeks in a bank before being supplied to customers. Different sizes of banks are required for different lengths of time at different points in time. Bigger banks increase the floor space capacity and reduce handling costs. The proper location of banks reduces the total space requirement and bank movement after building. In this paper, we address the bank size and location problem and solve it by using a mathematical programming approach.     

Nonlinear programming and genetic search application for production scheduling in coal mines

Efforts to eliminate unnecessary scheduling and inventory problems faced by the coal industry today initiated the development of a generalized, nonlinear programming model. Although no accepted methodology for developing such a model for this purpose currently exists, one was created and successfully tested. Production and transportation cost estimates were obtained from independent coal mines in Illinois, Virginia, and Pennsylvania, and based on these estimates, a hypothetical model was developed and tested using genetic search for nonlinear optimization. The results of our tests indicate that the model has potential for decision support in coal mines.     

Solving a multi-objective multi-skilled manpower scheduling model by a fuzzy goal programming approach

Manpower scheduling is an intricate problem in production and service environments with the purpose of generating fair schedules that consider employers’ objectives and employees’ preferences as much as possible. However, sometimes, vagueness of information related to employers’ objectives and employees’ preferences leads to the fuzzy nature of the problem. This paper presents a multi-objective manpower scheduling model regarding the lack of clarity on the target values of employers’ objectives and employees’ preferences. Hence, a fuzzy goal programming model is developed for the presented model. Afterwards, two fuzzy solution approaches are used to convert the fuzzy goal programming model to two single-objective models. Finally, the results obtained by both single-objective models are compared with each other to select the solution that has the greatest degree of the satisfaction level of employers’ objectives and employees’ preferences.     

Hierarchical production planning and scheduling with random demand and production failure

A multiple-objective hierarchical production planning and scheduling model is developed that integrates aggregate type decisions, family disaggregate decisions, lotsizing and scheduling of the jobs. It is assumed that demand and production failure are subject to uncertainties. Stochastic programming with recourse using a constraint sample approximation method is used to incorporate random demand and production failure into the model. The model evaluates final production plans, updates the demand forecasts and proceeds on a rolling horizon manner. Experimental results show that it is sufficient to generate and incorporate into the aggregate type model a small sample of the stochastic constraints from an infinite set of scenarios. A heuristic scheduling algorithm provides detailed information regarding the progress of jobs through work centers. This information is extremely useful in resolving infeasibilities during the production process. Other features of the model are also reported.     

Environmental supply chain network design using multi-objective fuzzy mathematical programming

The concern about environmental impact of business activities has spurred an interest in designing environmentally conscious supply chains. This paper proposes a multi-objective fuzzy mathematical programming model for designing an environmental supply chain under inherent uncertainty of input data in such problem. The proposed model is able to consider the minimization of multiple environmental impacts beside the traditional cost minimization objective to make a fair balance between them. A life cycle assessment-based (LCA-based) method is applied to assess and quantify the environmental impact of different options for supply chain network configuration. Also, to solve the proposed multi-objective fuzzy optimization model, an interactive fuzzy solution approach is developed. A real industrial case is used to demonstrate the significance and applicability of the developed fuzzy optimization model as well as the usefulness of the proposed solution approach.     

一类半无限规划的一种渐近替代约束方法和收敛性

A class of constrained semi infinite minimax problem is transformed into a simpleconstrained problem, by means of discretization decoraposirion and maximum entropy method,making use of surrogate constraint, The paper deals with the convergence of this asymptotic aI-proach method.     

均衡约束数学规划的约束规格和最优性条件综述

约束规格在约束优化问题的最优性条件中起着重要的作用,介绍了近几年国际上关于均衡约束数学规划(简记为MPEC)的约束规格以及最优性条件的研究成果, 包括以下主要内容: (1) MPEC常用的约束规格(如线性无关约束规格 (MPEC-LICQ)、Mangasarian-Fromovitz约束规格 (MPEC-MFCQ)等)和新的约束规格(如恒秩约束规格、常数正线性相关约束规格等), 以及它们之间的关系; (2) MPEC常用的稳定点; (3) MPEC的最优性条件. 最后还对MPEC的约束规格和最优性条件的研究前景进行了探讨.