Leader-member exchange as a linking pin in the idiosyncratic deals - Performance relationship in workgroups

In the current investigation, idiosyncratic deals (i-deals; individualized work arrangements) are modeled as differentiated resources that shape leader-member exchange (LMX) relationships in workgroups. We integrate literature on leader-member exchange (LMX) with research on i-deals to argue that employee evaluations of i-deals received from the grantor –typically the leader- enhance employee perceptions of LMX, which in turn become instrumental in generating positive performance outcomes. Furthermore, because workgroup characteristics have potential implications on the relationship between a deal grantor and the deal recipient, drawing upon social identity theory of leadership, we reason that the i-deals-LMX relationship is affected by the overall value congruence among the group members. Cross-level moderated mediation analyses on multi source data obtained from 289 employees nested in 60 workgroups showed that the mediational role of LMX in the i-deals to performance outcomes relationship was weaker in high value congruence groups.     

基于物联网的在线、智能调度方法的相关思考

物联网的飞速发展给生产调度系统带来了前所未有的机遇和挑战,数据的多源异构和连续涌入性、信息的透明性以及人、物料、设备、生产过程、产品等众多对象呈现出的连续动态存在性,这些新特征导致传统的调度优化方法难以适用。在已有研究的基础上,总结了物联网、调度优化方法以及基于情景的建模方法的研究现状和存在的问题,分析基于物联网的在线智能调度涉及到的问题及其特征,并提出其中的关键科学问题是基于情景的在线建模方法;提出该问题未来的研究目标为:针对物联网环境下调度对象状态的动态连续变化性,提供一种在线实时的智能优化调度方法,以最终实现调度优化过程的连续性以及调度优化决策的科学性、有效性和实用性;并详细阐述了未来关于基于情景的建模方法、基于情景的模型实时求解方法和基于情景的在线调度决策支持方法三方面的研究内容,为后续的深入研究做前期的思考和探索。     

Bounds on the domination number of a digraph

A vertex subset S of a digraph D is called a dominating set of D if every vertex not in S is adjacent from at least one vertex in S. The domination number of D, denoted by \(\gamma (D)\), is the minimum cardinality of a dominating set of D. The Slater number \(s\ell (D)\) is the smallest integer t such that t added to the sum of the first t terms of the non-increasing out-degree sequence of D is at least as large as the order of D. For any digraph D of order n with maximum out-degree \(\Delta ^+\), it is known that \(\gamma (D)\ge \lceil n/(\Delta ^++1)\rceil \). We show that \(\gamma (D)\ge s\ell (D)\ge \lceil n/(\Delta ^++1)\rceil \) and the difference between \(s\ell (D)\) and \(\lceil n/(\Delta ^++1)\rceil \) can be arbitrarily large. In particular, for an oriented tree T of order n with \(n_0\) vertices of out-degree 0, we show that \((n-n_0+1)/2\le s\ell (T)\le \gamma (T)\le 2s\ell (T)-1\) and moreover, each value between the lower bound \(s\ell (T)\) and the upper bound \(2s\ell (T)-1\) is attainable by \(\gamma (T)\) for some oriented trees. Further, we characterize the oriented trees T for which \(s\ell (T)=(n-n_0+1)/2\) hold and show that the difference between \(s\ell (T)\) and \((n-n_0+1)/2\) can be arbitrarily large. Some other elementary properties involving the Slater number are also presented.     

汽车产业链演化机理及影响因素研究

汽车产业链是汽车产业重要组织模式,其演化与整合升级对汽车产业发展具有重要意义。本文从汽车产业链演化动因出发,重点分析汽车产业链演化过程,分析归纳影响汽车产业链演化影响因素。在此基础上,以东北地区汽车产业为例,运用主成分回归分析方法对汽车产业链演化影响因素进行实证检验,结果表明各影响因素与东北地区汽车产业链演化发展水平存在不同方向和程度的相关关系。     

Neighbor sum distinguishing index of 2-degenerate graphs

We consider proper edge colorings of a graph G using colors in \(\{1,\ldots ,k\}\). Such a coloring is called neighbor sum distinguishing if for each pair of adjacent vertices u and v, the sum of the colors of the edges incident with u is different from the sum of the colors of the edges incident with v. The smallest value of k in such a coloring of G is denoted by \({\mathrm ndi}_{\Sigma }(G)\). In this paper we show that if G is a 2-degenerate graph without isolated edges, then \({\mathrm ndi}_{\Sigma }(G)\le \max \{\Delta (G)+2,7\}\).     

Is Tattooing a Risk Factor for Adolescents’ Criminal Behavior? Empirical Evidence from an Administrative Data Set of Juvenile Detainees in Taiwan

Juvenile crime affects not only the victims of the crime but also the delinquents’ future. How to prevent adolescent criminal behavior has become an important public policy issue. This study contributes to this interesting issue by examining the relationship between tattooing and adolescents’ criminal behavior. In particular, this study investigates whether or not having a tattoo/tattoos is connected to the incidence of various criminal activities, including: larceny, robbery, fraud, assault, drug use, and homicide. A unique sample of 973 juvenile detainees drawn from the administrative profiles in Taiwan and the coarsened exact matching method were utilized. Results show that compared to their nontattooed counterparts, tattooed juvenile detainees were significantly more likely to commit fraud, assault, drug abuse, and homicide by 3%, 13%, 9%, and 9%, respectively. In contrast, tattooing was not significantly associated with larceny or robbery. From a policy perspective, given the significant link between tattooing and criminal behavior, the presence of a tattoo in adolescents may serve as a valuable indicator regarding adolescents’ high probability of committing crimes.     

A lower bound for the adaptive two-echelon capacitated vehicle routing problem

Adaptive two-echelon capacitated vehicle routing problem (A2E-CVRP) proposed in this paper is a variant of the classical 2E-CVRP. Comparing to 2E-CVRP, A2E-CVRP has multiple depots and allows the vehicles to serve customers directly from the depots. Hence, it has more efficient solution and adapt to real-world environment. This paper gives a mathematical formulation for A2E-CVRP and derives a lower bound for it. The lower bound is used for deriving an upper bound subsequently, which is also an approximate solution of A2E-CVRP. Computational results on benchmark instances show that the A2E-CVRP outperforms the classical 2E-CVRP in the costs of routes.     

Total completion time minimization in online hierarchical scheduling of unit-size jobs

This paper investigates an online hierarchical scheduling problem on m parallel identical machines. Our goal is to minimize the total completion time of all jobs. Each job has a unit processing time and a hierarchy. The job with a lower hierarchy can only be processed on the first machine and the job with a higher hierarchy can be processed on any one of m machines. We first show that the lower bound of this problem is at least \(1+\min \{\frac{1}{m}, \max \{\frac{2}{\lceil x\rceil +\frac{x}{\lceil x\rceil }+3}, \frac{2}{\lfloor x\rfloor +\frac{x}{\lfloor x\rfloor }+3}\}\), where \(x=\sqrt{2m+4}\). We then present a greedy algorithm with tight competitive ratio of \(1+\frac{2(m-1)}{m(\sqrt{4m-3}+1)}\). The competitive ratio is obtained in a way of analyzing the structure of the instance in the worst case, which is different from the most common method of competitive analysis. In particular, when \(m=2\), we propose an optimal online algorithm with competitive ratio of \(16\) \(/\) \(13\), which complements the previous result which provided an asymptotically optimal algorithm with competitive ratio of 1.1573 for the case where the number of jobs n is infinite, i.e., \(n\rightarrow \infty \).     

Cloud manufacturing system for sheet metal processing

Abstract

Cloud computing is changing the way industries and enterprises run their businesses. Cloud manufacturing is emerging as an approach to transform the traditional manufacturing business model, while helping the manufacturer to align production efficiency with its business strategy, and creating intelligent factory networks that enable collaboration across the whole enterprise. Many production planning and control (PPC) problems are essentially optimisation problems, where the objective is to develop a plan that meets the demand at minimum cost or maximum profit. Because the underlying optimisation problem will vary in the different business and operation phases, it is important to think about optimisation in a dynamic mechanism and in a number of interlinked sub-problems at the same time. Cloud manufacturing has the potential to offer decision support as a service and medium of communication in PPC. To solve these problems and produce collaboration across the supply chain, this paper provides an overview of the state of the art in cloud manufacturing and presents a model of cloud-based production planning and production system for sheet metal processing.