A note on minimizing the sum of squares of machine completion times on two identical parallel machines-Reference-Cited by-同舟云学术

A note on minimizing the sum of squares of machine completion times on two identical parallel machines

Published:2015-11-16 Issue:1 Volume:25 Page:139-144
ISSN:1435-246X
Container-title:Central European Journal of Operations Research
language:en
Short-container-title:Cent Eur J Oper Res

Author:

Walter Rico

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research

Link

http://link.springer.com/content/pdf/10.1007/s10100-015-0429-0.pdf

Reference10 articles.

1. Alon N, Azar Y, Woeginger GJ, Yadid T (1997) Approximation schemes for scheduling. In: Proceedings of the 8th symposium on discrete algorithms, pp 493–500

2. Chandra AK, Wong CK (1975) Worst-case analysis of a placement algorithm related to storage allocation. SIAM J Comput 4:249–263

3. Cody RA, Coffman EG (1976) Record allocation for minimizing expected retrieval costs on drum-like storage devices. J ACM 23:103–115

4. Goldberg RR, Shapiro J (1999) A tight upper bound for the $$k$$ k -partition problem on ideal sets. Oper Res Lett 24:164–173

5. Goldberg RR, Shapiro J (2000) Partitioning under the $$L_p$$ L p norm. Eur J Oper Res 123:585–592

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

1. Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling;Theory and Practice of Logic Programming;2023-01-26

2. Single workgroup scheduling problem with variable processing personnel;Central European Journal of Operations Research;2019-10-17

3. A tight linear time $$\frac{13}{12}$$ 13 12 -approximation algorithm for the $$P2 || C_{\max }$$ P 2 | | C max problem;Journal of Combinatorial Optimization;2019-03-18