Font Size:
a
A
A
Keyword [NP-hardness]
Result: 1 - 8 | Page: 1 of 1
1.
Algorithms And Complexity Of Some Routing Scheduling Problems
2.
Some Problems Of The Batch Scheduling And Scheduling With Availability Constraints
3.
Rescheduling Research Under Pareto Optimization And Disruption Constraint
4.
A Proof Of NP-hardness And A FPTAS For The Batching Problem With Rejection
5.
Scheduling Problems About Order And Parallel Machines
6.
Research On Single-machine Scheduling With Positional Due-indices And Completion-time Deadlines On The Jobs
7.
Design Of Algorithms And Analysis Of The Call Control Problem With Penalty Costs
8.
The A-complete Matching Problem
<<First
<Prev Next>
Last>>
Jump to
