Ke Liangjun

Liangjun Ke

Information about the author Liangjun Ke will soon be added to the site.
Found 5 papers in total
Proportion‐based robust optimization and team orienteering problem with interval data
Proportion‐based robust optimization and team orienteering problem with interval data
2013
In this paper, a proportion‐based robust optimization approach is developed to...
Single machine scheduling with total tardiness criterion and convex controllable processing times
Single machine scheduling with total tardiness criterion and convex controllable processing times
2011
We consider a single machine scheduling problem with total tardiness criteria and...
A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
2010
In most deterministic scheduling problems, job-processing times are regarded as...
An ant colony optimization approach for the multidimensional knapsack problem
An ant colony optimization approach for the multidimensional knapsack problem
2010
Ant colony optimization is a metaheuristic that has been applied to a variety of...
Ants can solve the team orienteering problem
Ants can solve the team orienteering problem
2008
The team orienteering problem involves finding a set of paths from the starting point...
Papers per page: