Scheduling and Outsourcing with Multiple Customers

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

Chinese Quarterly Journal of Mathematics ›› 2015, Vol. 30 ›› Issue (3): 330-338.doi: 10.13371/j.cnki.chin.q.j.m.2015.03.003

Previous Articles Next Articles

Scheduling and Outsourcing with Multiple Customers

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

Received:2013-04-07 Online:2015-09-30 Published:2020-11-20
About author: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.
Supported by:
Supported by the National Natural Science Foundation of China(71372007)； Supported by the Natural Science Foundation of Shandong Province(ZR2011AL017)；

Abstract

Abstract: 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.

Key words: scheduling, outsourcing, dynamic programming, multiple customers

CLC Number:

O223

FENG Yan-ling, ZHANG Yu-zhong, JIA Guo-zhu. Scheduling and Outsourcing with Multiple Customers[J]. Chinese Quarterly Journal of Mathematics, 2015, 30(3): 330-338.

[1]	HE Ru-yan, YUAN Jin-jiang, ZHANG Yuan. A Note on Preemptive Scheduling with Multiple Maintenance Activities to Minimize the Total Late Work [J]. Chinese Quarterly Journal of Mathematics, 2022, 37(4): 331-342.
[2]	ZHANG Li-qi, ZHOU Song-tao, LU Ling-fa. A Note on Two-Agent Scheduling with Rejection on a Single Machine [J]. Chinese Quarterly Journal of Mathematics, 2022, 37(4): 394-402.
[3]	SHEN Hui-jun, GENG Zhi-chao. A Note on Single-Machine Lot Scheduling with Splittable Jobs to Minimize the Number of Tardy Jobs [J]. Chinese Quarterly Journal of Mathematics, 2022, 37(4): 412-421.
[4]	GAO Yuan, DANG Jia-rui, PENG Juan. Research on Unbounded Parallel-Batch Scheduling with Jobs Having Set-Up Times [J]. Chinese Quarterly Journal of Mathematics, 2022, 37(4): 422-429.
[5]	MENG Jin-tao, LU Xiao-xu, LI Shi-sheng, ZHOU Yong-wei. Batch Scheduling with Job Processing Time Compatibility and Rejection on a Single Machine [J]. Chinese Quarterly Journal of Mathematics, 2020, 35(3): 320-330.
[6]	LIN Hao, HE Cheng. A Note on DP Algorithm for Batching Scheduling to Minimize Maximum Lateness [J]. Chinese Quarterly Journal of Mathematics, 2018, 33(2): 206-211.
[7]	CHEN Rong-jun, QIN Li-zhen, TANG Guo-chun. Bicriteria Scheduling on Single Machine with Outsourcing [J]. Chinese Quarterly Journal of Mathematics, 2015, 30(4): 524-531.
[8]	XU Xiao-yan, MU Yun-dong, GUO Xiao, HAO Yun. Rescheduling to Minimize Total Completion Time Under a Limit Time Disruption for the Parallel Batch [J]. Chinese Quarterly Journal of Mathematics, 2015, 30(2): 274-279.
[9]	HE Cheng, LIN Hao, DOU Jun-mei, MU Yun-dong. Bicriteria Scheduling on a Series-Batching Machine to Minimize Makespan and Total Weighted Completion Time with Equal Length Job [J]. Chinese Quarterly Journal of Mathematics, 2014, 29(2): 159-166.
[10]	CHEN Rong-jun, TANG Guo-chun. Scheduling and Subcontracting under Parallel Machines [J]. Chinese Quarterly Journal of Mathematics, 2012, 27(4): 590-597.
[11]	MU Yun-dong. Rescheduling Problems with Bicriteria [J]. Chinese Quarterly Journal of Mathematics, 2009, 24(3): 349-356.
[12]	FENG Mi-luo. Optimal Batching Structures of Single Machine Scheduling [J]. Chinese Quarterly Journal of Mathematics, 2009, 24(1): 132-137.
[13]	CHEN You-jun, LIN Yi-xun. Some Results on Position Restriction Scheduling Problems [J]. Chinese Quarterly Journal of Mathematics, 2008, 23(2): 202-206.
[14]	. The Single Machine Parallel Batch Scheduling Problem with Job Compatibility Constraints [J]. Chinese Quarterly Journal of Mathematics, 2007, 22(4): 597-601.
[15]	Single Machine Scheduling Problem with Release Dates and Two Hierarchical Criteria to Minimize Makespan and Stocking CostLI Wen-hua . Single Machine Scheduling Problem with Release Dates and Two Hierarchical Criteria to Minimize Makespan and Stocking Cost [J]. Chinese Quarterly Journal of Mathematics, 2006, 21(1): 103-109.

Scheduling and Outsourcing with Multiple Customers

PDF (PC)

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics

Comments