Project scheduling problem is to determine the schedule of allocating resources so as to balance the total cost and the completion time. This paper considers project scheduling problem with uncertain activity duration times and presents four new uncertain programming models for different management requirements. Moreover, taking advantage of some properties of uncertainty theory, these models c...

In this paper, we consider the multiobjective linear programs where coefficients in the objective function belong to uncertainty sets. We introduce the concept of robust efficient solutions to uncertain multiobjective linear programming problems. By using two scalarization methods, the weighted sum method and the ϵ-constraint method, we obtain that the robust efficient solutions for uncertain m...

Project scheduling with uncertain durations becomes a research focus with the development of uncertainty theory. Most researches concerned aim at minimizing project makespan or project cost according to different decision criterions. However, few works considered resource constraint, which initially appeared in deterministic resource-constrained project scheduling problem (RCPSP) and reflects t...

We have developed a new undergraduate programming course, which has so far been taught three. Teaching practical tools and techniques without a sound conceptual basis. Matted PDF at the other, and the user interfaces are often quite polished. Overall.teaching programming, epitomized in the line of languages designed by Niklaus. Coffee fueled some of the reflections behind this course: Life is u...

*Correspondence: [email protected] 1School of Management, Shanghai University, 99 Shangda Road, 200444 Shanghai, China Full list of author information is available at the end of the article Abstract Quality function deployment (QFD) is a new product development tool remarked with interpreting customer requirements into engineering characteristics of the design process. On account of the in...

Abstract. Duality theory has played a key role in convex programming in the absence of data uncertainty. In this paper, we present a duality theory for convex programming problems in the face of data uncertainty via robust optimization. We characterize strong duality between the robust counterpart of an uncertain convex program and the optimistic counterpart of its uncertain Lagrangian dual. We...

Non-parametric DEA is a technique on the basic of mathematical programming to determine the efficiency of homological decision making units. DEA models changes in demand cause changes in variations in output levels and also will cause changes in a firm’s inefficiency. Often a firm can adjust input influencing on the output level. Models designed with technique on DEA that considers changes in d...

data envelopment analysis is a nonparametric technique checking efficiency of dmus using math programming. in conventional dea, it has been assumed that the status of each measure is clearly known as either input or output. kao and hwang (2008) developed a data envelopment analysis (dea) approach for measuring efficiency of decision processes which can be divided into two stages. the first stag...