.png){kind=icon}
返回
Single machine scheduling with outsourcing allowed
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijpe.2007.02.036.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper considers a single-machine scheduling problem with outsourcing allowed, where each job can be either processed on an in-house single-machine or outsourced. Outsourcing is commonly required as a way to improve productivity effectively and efficiently in various companies, especially, including electronics industries and motor industries. The objective is to minimize the weighted sum of the outsourcing cost and the scheduling measure represented by the sum of completion times, subject to outsourcing budget. In the problem analysis, it is proved that the proposed problem is NP-hard in the ordinary sense, and some solution properties are characterized. Therewith, two associated heuristic algorithms and the branch-and-bound algorithm are derived. Numerical experiments are conducted to evaluate the performance of the derived algorithms, and some managerial insights of the heuristic algorithms are provided. (C) 2007 Elsevier B.V. All rights reserved.
Keyword:
single-machine scheduling
outsourcing strategy
branch-and-bound
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10
论文数:
8.1K
被引数:
3.6W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏New Physics with Evanescent Wave Atomic Mirrors: The van der
Waals Force and Atomic Diffraction
PREAI
分享收藏
查看更多内容