fully polynomial-time approximation scheme - Globe Thesis

Font Size: a A A

Keyword [fully polynomial-time approximation scheme] Result: 1 - 19 \| Page: 1 of 1
1.	Scheduling Problem With Non-availability Interval And Rejection
2.	Approximation Algorithm Of Scheduling Problem
3.	Machine Scheduling Problem With The Denial Of Costs
4.	Parallel-machine Scheduling Of Deteriorating Jobs With Potential Machine Disruptions
5.	Scheduling Problems With Rejection To Minimize Two New-type Objective Functions
6.	Research On Game And Supply Chain Management Based On Scheduling Theory
7.	Research For Some Parallel Identical Shop Scheduling Problems
8.	Research On The Algorithms For Early Work Maximization Scheduling Problem
9.	Design Of Algorithms And Analysis Of The Call Control Problem With Penalty Costs
10.	Research On Scheduling Problems With The Feature Of Phased Job Processing
11.	Single-machine Scheduling With Rejection And An Operator Non-availability Interval
12.	Model And Optimization Algorithm For Scheduling Problem With Due Date And Machine Availability Constraints
13.	Scheduling Problems With Job Cumulative Effects
14.	Model And Optimization Algorithm For Rejectable Scheduling Problem With Machine Availability Constraints
15.	Research On MapReduce And Related Sorting Problems In Big Dat
16.	Single Machine Scheduling With Rejection And Generalized Parameters
17.	Connected Graph Partition Problem With Upper Bound
18.	ND Two-agent Scheduling Problems With Rejection On A Single Machine
19.	Step-like Degenerate Rejectable Sorting Proble
<<First <Prev Next> Last>> Jump to