z-logo
open-access-imgOpen Access
Algorithm for Cost Non-preemptive Scheduling of Partial k-Trees
Author(s) -
Yiming Li
Publication year - 2012
Publication title -
open journal of applied sciences
Language(s) - English
Resource type - Journals
eISSN - 2165-3925
pISSN - 2165-3917
DOI - 10.4236/ojapps.2012.24b053
Subject(s) - combinatorics , scheduling (production processes) , disjoint sets , mathematics , job shop scheduling , vertex (graph theory) , computer science , discrete mathematics , graph , mathematical optimization , schedule , operating system

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom