Scheduling independent tasks with multiple modes
type: Item
instance of: scholarly article
title: Scheduling independent tasks with multiple modes
zbMATH Open document ID: 0837.90064
DOI: 10.1016/0166-218X(95)00003-A
author: Yanyan Li
published in: Discrete Applied Mathematics
publication date: 1995-10-17T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 806406
zbMATH Keywords: nonpreemptive scheduling
zbMATH Keywords: renewable resources
zbMATH Keywords: makespan
MaRDI profile type: Publication
cites work: On the Maximum Weight Clique Problem
cites work: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
cites work: On graphs with polynomially solvable maximum-weight clique problem
cites work: Q3679215
cites work: Nonpreemptive scheduling of independent tasks with prespecified processor allocations
cites work: Scheduling multiprocessor tasks on three dedicated processors
cites work: Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
cites work: Q4198056
cites work: Q3328583
cites work: The complexity of scheduling independent two-processor tasks on dedicated processors
cites work: Q3940839
cites work: On chromatic number of finite set-systems
cites work: A decomposition approach for a resource constrained scheduling problem
cites work: Hierarchical models for multi-project planning and scheduling
cites work: Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
full work available at URL: 0166-218x(95)00003-a
OpenAlex ID: W1966303487
Recommended article: A new approach for scheduling independent tasks with multiple modes
Recommended article: Scheduling independent multiprocessor tasks
Recommended article: Q4427860
Recommended article: Multitasking scheduling with alternate periods
Recommended article: Scheduling Independent Tasks on Uniform Processors
Recommended article: Scheduling parallel tasks with individual deadlines
Recommended article: Q4221077
description: scientific article; zbMATH DE number 806406