OpenAlex | An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs

An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs

Work

Year: 1996

Type: article

Source: Algorithmica

Authors Sivaprakasam Sunder, Xin He

Institutions University of Delaware, University at Buffalo, State University of New York

Cites: 19

Cited by: 1

Related to: 10

FWCI:

Citation percentile (by year/subfield): 52.85

Topic: Scheduling and Optimization Algorithms

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: closed