Mixed integer (0–1) fractional programming for decision support in paper production industry

This paper presents an effective and efficient method for solving a special class of mixed integer fractional programming (FP) problems. We take a classical reformulation approach for continuous FP as a starting point and extend it for solving a more general class of mixed integer (0–1) fractional programming problems.To stress the practical relevance of the research we focus on a real-life application in paper production industry. The constantly advancing physical knowledge of large scale pulp and paper production did have a substantial impact on an existing DSS in which mixed integer (0–1) fractional programming is introduced. We show that the motivation to solve a real-life fractional programming problem can provide the basis for a new approach in a new context that has an added value of its own, even outside the given application area. We describe the main characteristics of the DSS, the necessity to develop a non-iterative solution procedure and demonstrate both the effectiveness and efficiency of the proposed approach from practical data sets.     

Staff rostering in call centers providing employee transportation

We address the staff rostering problem in call centers with the goal of balancing operational cost, agent satisfaction and customer service objectives. In metropolitan cities such as Istanbul and Mumbai, call centers provide the transportation of their staff so that shuttle costs constitute a significant part of the operational costs. We develop a mixed integer programming model that incorporates the shuttle requirements at the beginning and end of the shifts into the agent-shift assignment decisions, while considering the skill sets of the agents, and other constraints due to workforce regulations and agent preferences. We analyze model solutions for a banking call center under various management priorities to understand the interactions among the conflicting objectives. We show that considering transportation costs as well as agent preferences in agent-shift assignments provides significant benefits in terms of both cost savings and employee satisfaction.     

Incorporating balance concerns in resource allocation decisions: A bi-criteria modelling approach

We consider resource allocation problems where inputs are allocated to different entities such as activities, projects or departments. In such problems a common goal is achieving a desired balance in the allocation over different categories of the entities. We propose a bi-criteria framework for trading balance off against efficiency. We define and categorise indicators based on balance distribution and propose formulations and solution algorithms which provide insight into the balance-efficiency tradeoff. We illustrate our models by applying them to the data of a portfolio selection problem faced by a science funding agency and to randomly generated large-sized problem instances to demonstrate computational feasibility.     

Optimal hedging through limit orders

This article applies the methods of stochastic dynamic programming to a risk management problem, where an agent hedges her derivative position by submitting limit orders. Therefore, this model is the first, in the literature on optimal trading with limit orders, to handle a problem of hedging options or other derivatives. A hedging strategy is developed where both the size and the limit price of each order is optimally set.     

Strategies for fostering basic psychological needs support in high quality youth leadership programs

Youth leadership programming has become an increasingly common context to foster basic psychological needs and promote youth development. The purpose of this qualitative study was to explore strategies involved in fostering youth needs support within six leadership programs. Two leaders and 30 youth participated in semi-structured interviews to better understand the strategies used to foster needs support. Findings revealed that leaders were able to foster a sense of relatedness among youth through building trusting adult-youth relationships and nurturing an inclusive environment. Maximizing choice and negotiating youth voice helped to foster youth’s autonomy. Finally, creating a task-oriented climate and providing intentional opportunities for skill-building helped to foster youth’s competence. Findings suggest that training for leaders is critical in understanding what, and how strategies should be employed to help foster youth needs support in leadership programming. Limitations and future directions are outlined.     

Production and changeover control policies of a class of failure prone buffered flow-shops

This article deals with a stochastic optimal control problem for a class of buffered multi-parts flow-shops manufacturing system. The involved machines are subject to random breakdowns and repairs. The flow-shop under consideration is not completely flexible and hence requires setup time and cost in order to switch the production from a part type to another, this changeover is carried on the whole line. Our objective is to find the production plan and the sequence of setups that minimise the cost function, which penalises inventories/backlogs and setups. A continuous dynamic programming formulation of the problem is presented. Then, a numerical scheme is adopted to solve the obtained optimality conditions equations for a two buffered serial machines two parts case. A complete heuristic policy, based on the numerical observations which describe the optimal policies in system states, is developed. It will be shown that the obtained policy is a combination of a KANBAN/CONWIP and a modified hedging corridor policy. Moreover, based on our observations and existent research studies extension to cover more complex flow-shops is henceforth possible. The robustness of such a policy is illustrated through sensitivity analysis.     

汇编语言程序设计教学改革初探

汇编语言程序设计是计算机专业重要的基础课程,但由于其抽象、指令多等原因受到学生的忽视,实际教学效果很差。针对汇编语言程序设计的特点及目前教学现状,从改善教学效果和培养学生兴趣为出发点,对课程的教学内容、方法及手段进行探索,提高教学及实验效果,从而使汇编语言发挥其专业核心课的作用。     

Benefits of Hybrid Lateral Transshipments in Multi‐Item Inventory Systems under Periodic Replenishment

Lateral transshipments are a method of responding to shortages of stock in a network of inventory‐holding locations. Conventional reactive approaches only seek to meet immediate shortages. The study proposes hybrid transshipments which exploit economies of scale by moving additional stock between locations to prevent future shortages in addition to meeting immediate ones. The setting considered is motivated by retailers who operate networks of outlets supplying car parts via a system of periodic replenishment. It is novel in allowing non‐stationary stochastic demand and general patterns of dependence between multiple item types. The generality of our work makes it widely applicable. We develop an easy‐to‐compute quasi‐myopic heuristic for determining how hybrid transshipments should be made. We obtain simple characterizations of the heuristic and demonstrate its strong cost performance in both small and large networks in an extensive numerical study.     

一种求解双目标flow shop排序问题的进化算法

提出一种求解双目标flow shop排序的递进多目标进化算法.算法采用改进的精英复制策略,在实现精英保留的前提下降低了计算复杂性;通过递进进化模式增加群体多样性,改善了算法收敛性;通过群体进化过程中对非劣解集进行竞争型可变邻域启发式搜索,增强了算法局部搜索性能.采用新算法和参照算法NSGA-II对31个标准双目标flow shop算例进行优化.研究结果表明,新算法在所有算例的求解中均获得了优于NSGA-II的非劣解集,验证了算法的有效性.     

Hard thresholding regression

In this paper, we propose the hard thresholding regression (HTR) for estimating high‐dimensional sparse linear regression models. HTR uses a two‐stage convex algorithm to approximate the ?₀‐penalized regression: The first stage calculates a coarse initial estimator, and the second stage identifies the oracle estimator by borrowing information from the first one. Theoretically, the HTR estimator achieves the strong oracle property over a wide range of regularization parameters. Numerical examples and a real data example lend further support to our proposed methodology.