Skip to main navigation
Skip to search
Skip to main content
PolyU Scholars Hub Home
Help & FAQ
Link opens in a new tab
Search content at PolyU Scholars Hub
Home
Researchers
Units
Research output
Prizes
Activities
Press/Media
Student theses
Two parallel-machine scheduling with maximum waiting time for an emergency job
Yiwei Jiang
, Haodong Yuan
, Ping Zhou
,
T. C.E. Cheng
, Min Ji
Department of Logistics and Maritime Studies
The Hong Kong Polytechnic University
Research output
:
Journal article publication
›
Comment/debate/erratum
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Two parallel-machine scheduling with maximum waiting time for an emergency job'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Makespan
100%
Parallel Machine Scheduling
100%
Worst-case Performance
100%
Maximum Waiting Time
100%
Two Parallel Machines
100%
Numerical Results
50%
Tight
50%
Existing Algorithms
50%
Production Efficiency
50%
Optimal Schedule
50%
Scheduling Jobs
50%
Approximation Algorithms
50%
Urgent Orders
50%
Service Efficiency
50%
Service Tasks
50%
Urgent Task
50%
Traditional Manufacturing Industry
50%
Modern Service Industry
50%
Random Arrival
50%
Improved Approximation
50%
Computer Science
Approximation Algorithms
100%
Job Scheduling
100%
Parallel Machine
100%
Parallel Machine Scheduling
100%
Mathematics
Worst Case
100%
Minimizes
50%