基于多客户的工件可转包排序问题

冯艳玲, 张玉忠, 贾国柱

doi:10.13371/j.cnki.chin.q.j.m.2015.03.003

数学季刊 >

2015 , Vol. 30 >Issue 3: 330 - 338

DOI: https://doi.org/10.13371/j.cnki.chin.q.j.m.2015.03.003

基于多客户的工件可转包排序问题

展开

1. School of Economics and Management, Beihang University2. School of Management, Qufu Normal University

FENG Yan-ling(1987-), female, native of Jining, Shandong, M.S.D., a Ph.D. candidate of Beihang University, engages in management science and engineering.

收稿日期: 2013-04-07

网络出版日期: 2020-11-20

基金资助

Supported by the National Natural Science Foundation of China(71372007)； Supported by the Natural Science Foundation of Shandong Province(ZR2011AL017)；

收起

Scheduling and Outsourcing with Multiple Customers

Expand

1. School of Economics and Management, Beihang University2. School of Management, Qufu Normal University

FENG Yan-ling(1987-), female, native of Jining, Shandong, M.S.D., a Ph.D. candidate of Beihang University, engages in management science and engineering.

Received date: 2013-04-07

Online published: 2020-11-20

Supported by

Supported by the National Natural Science Foundation of China(71372007)； Supported by the Natural Science Foundation of Shandong Province(ZR2011AL017)；

Fold

摘要

In this paper, we study a new scheduling and outsourcing model with multiple customers in which jobs can be processed by either in-house machine or outsourcing machine.All processed jobs have to be delivered in batches to their respective customers and each shipment incurs a delivery cost as well as a fixed amount of time. We discuss three commonly used objective functions, analyze their complexity and solve them by dynamic programming algorithms.

关键词： scheduling; outsourcing; dynamic programming; multiple customers

本文引用格式

冯艳玲, 张玉忠, 贾国柱 . 基于多客户的工件可转包排序问题[J]. 数学季刊, 2015 , 30(3) : 330 -338 . DOI: 10.13371/j.cnki.chin.q.j.m.2015.03.003

Abstract

Key words： scheduling; outsourcing; dynamic programming; multiple customers

Options

文章导航

模态框（Modal）标题

摘要

本文引用格式

Abstract