Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Qingqin Nong
Information about the author Qingqin Nong will soon be added to the site.
Found
3 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time
2011
In this article, we consider the concurrent open shop scheduling problem to minimize...
The single-machine parallel-batching on-line scheduling problem with family jobs to minimize makespan
2008
In this paper we consider the single-machine parallel-batching scheduling problem with...
The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
2008
We consider the problem of scheduling family jobs with release dates on a bounded...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers
