z-logo
open-access-imgOpen Access
Branch and Bound Algorithm for the Single Machine Scheduling Problem with Release and Delivery times
Author(s) -
N. S. Grigor'eva
Publication year - 2019
Publication title -
destech transactions on computer science and engineering
Language(s) - English
Resource type - Journals
ISSN - 2475-8841
DOI - 10.12783/dtcse/optim2018/27919
Subject(s) - computer science , preemption , scheduling (production processes) , idle , schedule , parallel computing , algorithm , job shop scheduling , branch and bound , least slack time scheduling , fair share scheduling , rate monotonic scheduling , real time computing , mathematical optimization , mathematics , 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