Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system
type: Item
instance of: scholarly article
title: Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system
zbMATH Open document ID: 1163.90008
author: Ling-Huey Su
published in: Computers \& Operations Research
publication date: 2008-11-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5363312
zbMATH Keywords: parallel machine scheduling
zbMATH Keywords: hierarchical criteria
zbMATH Keywords: total earliness and tardiness
zbMATH Keywords: flowtime
MaRDI profile type: Publication
full work available at URL: j.cor.2007.09.013
OpenAlex ID: W2046030366
cites work: Q4658190
cites work: Q4865763
cites work: Minimizing makespan subject to minimum flowtime on two identical parallel machines
cites work: Minimizing makespan subject to minimum total flow-time on identical parallel machines
cites work: Makespan minimization subject to flowtime optimality on identical parallel machines
cites work: Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
cites work: Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
cites work: Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
cites work: Scheduling under a common due-date on parallel unrelated machines
cites work: Parallel machine scheduling with a common due window
DOI: 10.1016/J.COR.2007.09.013
description: scientific article; zbMATH DE number 5363312