Skip to main navigation
Skip to search
Skip to main content
National Yang Ming Chiao Tung University Academic Hub Home
English
中文
Home
Profiles
Research units
Research output
Projects
Prizes
Activities
Equipment
Impacts
Search by expertise, name or affiliation
Parallel dedicated machine scheduling with conflict graphs
Huai Che Hong,
Bertrand M.T. Lin
*
*
Corresponding author for this work
Institute of Information Management
Research output
:
Contribution to journal
›
Article
›
peer-review
8
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Parallel dedicated machine scheduling with conflict graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Conflict Graph
100%
Processing Sequence
100%
Parallel Dedicated Machines
100%
Machine Scheduling
100%
Conflict Constraints
100%
Scheduling Problem
50%
Resource Availability
50%
Performance Measures
50%
Dynamic Programming Algorithm
50%
Time Dynamics
50%
Parallel Machine Scheduling Problem
50%
Identical Parallel Machines
50%
Polynomial Time
50%
Disjoint
50%
Two-machine
50%
Optimal Schedule
50%
Machine Settings
50%
Managerial Performance
50%
Feasible Schedule
50%
NP-hardness Proof
50%
Computer Science
Scheduling Problem
100%
Performance Measure
100%
Polynomial Time
100%
Dynamic Programming Algorithm
100%
Machine Scheduling Problem
100%
Parallel Machine
100%
Parallel Machine Scheduling
100%
Conflict Graph
100%
Feasible Schedule
100%
Resource Availability
100%