Approximate and branch-and-bound algorithms for the parallel machine scheduling problem with a single server-Reference-Cited by-同舟云学术

Approximate and branch-and-bound algorithms for the parallel machine scheduling problem with a single server

Author:

Liu Guo-Sheng¹²,Li Jin-Jin¹,Yang Hai-Dong³,Huang George Q.²

Affiliation:

1. School of Management, Guangdong University of Technology, Guangdong, China;

2. Department of Industrial and Manufacturing System Engineering, Hong Kong University, Hongkong, China;

3. School of Electro-Mechanical Engineering, Guangdong University of Technology, Guangdong, China

Funder

National Natural Science Foundation of China

New Pearl River Star Program of Guangzhou City

Publisher

Informa UK Limited

Subject

Marketing,Management Science and Operations Research,Strategy and Management,Management Information Systems

Link

Reference22 articles.

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. How to optimize service-oriented cloud manufacturing;Journal of the Operational Research Society;2024-08-02