Minimizing the sum of job completion times on capacitated parallel machines
type: Item
instance of: scholarly article
title: Minimizing the sum of job completion times on capacitated parallel machines
zbMATH Open document ID: 0810.90072
DOI: 10.1016/0895-7177(94)90024-8
author: Gur Mosheiov
published in: Mathematical and Computer Modelling
publication date: 1995-04-02T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 701671
zbMATH Keywords: capacitated parallel machines
zbMATH Keywords: parallel identical machines
zbMATH Keywords: sum of job completion times
zbMATH Keywords: NP-hard
zbMATH Keywords: efficient heuristic
MaRDI profile type: Publication
full work available at URL: 0895-7177(94)90024-8
OpenAlex ID: W2036466874
cites work: Capacitated two-parallel machines scheduling to minimize sum of job completion times
Recommended article: Minimizing the sum of job completion times on capacitated two-parallel machines
Recommended article: Capacitated two-parallel machines scheduling to minimize sum of job completion times
Recommended article: Maximizing the minimum completion time on parallel machines
Recommended article: Minimizing Total Completion Time on Parallel Machines with Deadline Constraints
Recommended article: Weighted completion time minimization for capacitated parallel machines
Recommended article: Parallel Processing and Applied Mathematics
Recommended article: A PTAS for minimizing the weighted sum of job completion times on parallel machines
Recommended article: A note on minimizing the sum of squares of machine completion times on two identical parallel machines
Recommended article: Q3195877
Recommended article: MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES
description: scientific article; zbMATH DE number 701671