OpenAlex | On sequencing with earliest starts and due dates with application to computing bounds for the (<i>n/m/G/F</i><sub>max</sub>) problem

On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problem

Work

Year: 1973

Type: article

Source: Naval Research Logistics Quarterly

Authors Paul Bratley, Michaël Florian, Pierre N. Robillard

Institutions Département d'Informatique, Université de Montréal

Cites: 4

Cited by: 72

Related to: 10

FWCI: 10.04

Citation percentile (by year/subfield): 98.18

Topic: Scheduling and Optimization Algorithms

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: closed