Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time

•Bicriteria scheduling problems on identical parallel machines.•Simultaneous optimization of the two objectives: the makespan and the total completion time.•Developing approximation algorithms relative to each objective’s optimal value.•A tradeoff curve of the approximation ratio.•Lower bound of the...

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 305; no. 2; pp. 594 - 607
Main Authors:	Jiang, Xiaojuan, Lee, Kangbok, Pinedo, Michael L.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.03.2023
Subjects:	Approximation algorithm Inapproximability Makespan Scheduling Total completion time Scheduling Makespan Approximation algorithm Total completion time Inapproximability
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!