A note on Pareto minimizing total completion time and maximum cost
type: Item
instance of: scholarly article
title: A note on Pareto minimizing total completion time and maximum cost
zbMATH Open document ID: 1408.90127
author: Yuan Gao
author: Jinjiang Yuan
published in: Operations Research Letters
publication date: 2018-09-28T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6945335
zbMATH Keywords: scheduling
zbMATH Keywords: Pareto optimization
zbMATH Keywords: maximum cost
zbMATH Keywords: complexity analysis
MaRDI profile type: Publication
full work available at URL: j.orl.2014.12.001
OpenAlex ID: W2041043169
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
cites work: Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty
cites work: Optimal Sequencing of a Single Machine Subject to Precedence Constraints
cites work: Solving a bicriterion scheduling problem
DOI: 10.1016/J.ORL.2014.12.001
description: scientific article; zbMATH DE number 6945335