Discrete-continuous scheduling problems -- mean completion time results
type: Item
instance of: scholarly article
title: Discrete-continuous scheduling problems -- mean completion time results
zbMATH Open document ID: 0953.90521
DOI: 10.1016/0377-2217(96)00130-0
author: Joanna Józefowska
author: Jan Węglarz
published in: European Journal of Operational Research
publication date: 1999-02-22T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1252898
zbMATH Keywords: scheduling theory
zbMATH Keywords: parallel machine scheduling
zbMATH Keywords: continuous resource
zbMATH Keywords: mean completion time
MaRDI profile type: Publication
full work available at URL: 0377-2217(96)00130-0
OpenAlex ID: W2055224357
cites work: Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation
cites work: Q4039985
cites work: Approximation algorithms for some discrete-continuous scheduling problems
cites work: On a methodology for discrete-continuous scheduling
cites work: Multiprocessor Scheduling with Memory Allocation—A Deterministic Approach
cites work: Q4749589
description: scientific article; zbMATH DE number 1252898