A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
type: Item
instance of: scholarly article
title: A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
zbMATH Open document ID: 0854.68007
DOI: 10.1016/0166-218X(94)00071-5
author: Eugeniusz Nowicki
author: Stanisław Zdrzałka
published in: Discrete Applied Mathematics
publication date: 1996-07-07T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68N20
zbMATH DE Number: 897347
MaRDI profile type: Publication
cites work: A multi-objective approach to resource allocation in single machine scheduling
cites work: The Theory of Networks and Management Science. Part I
cites work: Preemptive Scheduling of Uniform Processor Systems
cites work: Scheduling with deadlines and loss functions
cites work: A survey of results for sequencing problems with controllable processing times
cites work: Q3690568
cites work: A bicriterion approach to time/cost trade-offs in sequencing
cites work: Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
full work available at URL: 0166-218x(94)00071-5
OpenAlex ID: W1990176814
description: scientific article; zbMATH DE number 897347