One-machine job-scheduling with non-constant capacity -- minimizing weighted completion times
type: Item
instance of: scholarly article
title: One-machine job-scheduling with non-constant capacity -- minimizing weighted completion times
zbMATH Open document ID: 0951.90556
DOI: 10.1016/S0377-2217(96)00240-8
author: K. Appert
published in: European Journal of Operational Research
publication date: 2000-12-17T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 1299837
zbMATH Keywords: one-machine scheduling
zbMATH Keywords: non-constant capacity
zbMATH Keywords: weighted completion times
MaRDI profile type: Publication
cites work: Sequencing independent jobs with a single resource
cites work: Q3768666
description: scientific article; zbMATH DE number 1299837