Reducibility among single machine weighted completion time scheduling problems

Authors:
Marc E. Posner
Affiliations:
-
Venue:
Annals of Operations Research
Year:
1991

Citing 0
Cited 3

Scheduling jobs on a single machine to maximize the total revenue of jobs

Computers and Operations Research
Flexible solutions in disjunctive scheduling: General formulation and study of the flow-shop case

Computers and Operations Research
Worst-case evaluation of flexible solutions in disjunctive scheduling problems

ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

Abstract