Skip to main navigation
Skip to search
Skip to main content
New Jersey Institute of Technology Home
Help & FAQ
Home
Profiles
Research units
Facilities
Federal Grants
Research output
Press/Media
Search by expertise, name or affiliation
Minimizing busy time in multiple machine real-time scheduling
Rohit Khandekar
,
Baruch Schieber
, Hadas Shachnai
, Tami Tamir
Research output
:
Chapter in Book/Report/Conference proceeding
›
Conference contribution
32
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Minimizing busy time in multiple machine real-time scheduling'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Release Time
100%
Real-time Scheduling
100%
Processing Time
100%
Machine Capacity
100%
Multiple Machines
100%
Busy Time
100%
Power System
50%
Scheduling Problem
50%
Due Date
50%
Capacity Constraints
50%
Exact Algorithm
50%
Optical Network Units
50%
APX-hardness
50%
Approximation Algorithms
50%
Processing Demands
50%
Bound Algorithm
50%
Approximation Ratio
50%
Machine Settings
50%
Moldable Jobs
50%
Energy Scheduling
50%
Time Deadline
50%
Unit Processing Times
50%
Laminar Family
50%
Unit Commitment
50%
Total Busy Time
50%
Proper Interval Graph
50%
Optical Network Design
50%
Computer Science
Real Time Scheduling
100%
Processing Time
100%
Multiple Machine
100%
Network Design
33%
Optical Network
33%
Scheduling Problem
33%
Capacity Constraint
33%
Approximation Algorithms
33%
Approximation Ratio
33%
Exact Algorithm
33%
Unit Commitment
33%
Interval Graph
33%
Total Busy Time
33%
Bound Algorithm
33%
Mathematics
Minimizes
100%
Main Result
100%
Clique
100%
Optical Networks
100%
Interval Graph
100%
Fixed Time Interval
100%
Engineering
Processing Time
100%
Release Time
66%
Power Engineering
33%
Main Result
33%
Capacity Constraint
33%
Fiber Optic Networks
33%
Exact Algorithm
33%
Unit Commitment
33%