Scheduling problems with partially ordered jobs

Authors:
V. S. Gordon;A. B. Dolgui
Affiliations:
United Institute of Informatics Problems, Belarussian National Academy of Sciences, Minsk, Belarus;École Nationale Supérieure des Mines de Saint-Étienne, Saint-Étienne, France
Venue:
Automation and Remote Control
Year:
2010

Citing 6
Cited 0

Optimal sequencing by modular decomposition: Polynomial algorithms

Operations Research
Optimal sequencing via modular decomposition: characterization of sequencing functions

Mathematics of Operations Research
Earliness penalties on a single machine subject to precedence constraints

Computers and Operations Research
Handbook of Scheduling: Algorithms, Models, and Performance Analysis

Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint

Computers and Operations Research
Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

Scheduling problems with given precedence constraints (with partially ordered jobs) are considered. A review of the results obtained in this area by the members of Minsk Scheduling Theory school created by V.S. Tanaev is done.