Tang Guochun

Guochun Tang

Information about the author Guochun Tang will soon be added to the site.
Found 14 papers in total
A revised proof of the optimality for the Kise–Ibaraki–Mine algorithm
A revised proof of the optimality for the Kise–Ibaraki–Mine algorithm
2012
For the problem of scheduling n ‐jobs on one‐machine with agreeable job...
Open‐shop dense schedules: properties and worst‐case performance ratio
Open‐shop dense schedules: properties and worst‐case performance ratio
2012
Dense schedules are easy to construct and can be used as heuristic solutions for...
Optimality proof of the Kise–Ibaraki–Mine algorithm
Optimality proof of the Kise–Ibaraki–Mine algorithm
2012
Kise, Ibaraki and Mine (1978) give an O ( n 2 ) time algorithm to find an optimal...
Single‐machine scheduling problems with time and position dependent processing times
Single‐machine scheduling problems with time and position dependent processing times
2011
We consider single‐machine scheduling problems with time and position dependent...
A note on the optimality proof of the Kise-Ibaraki-Mine algorithm
A note on the optimality proof of the Kise-Ibaraki-Mine algorithm
2010
We give a counterexample to show that the optimality proof by Kise et al. (1978) for...
Scheduling with rejection
Scheduling with rejection
2006
The method of convex quadratic programming relaxation has been used for the scheduling...
Linear programming relaxation for scheduling problems
Linear programming relaxation for scheduling problems
2006
In this article we study linear programming relaxation for scheduling problems, and...
A pseudo-polynomially solvable case of the loader problem in modern logistics technology
A pseudo-polynomially solvable case of the loader problem in modern logistics technology
2005
The loader problem is a real problem from logistics technology. The embryonic form of...
Solving loader problem by using simplex algorithm
Solving loader problem by using simplex algorithm
2005
Loader problem is posed in this paper and that through simplex algorithm, we give its...
A branch and bound approach and heuristic algorithms for scheduling a batching machine
A branch and bound approach and heuristic algorithms for scheduling a batching machine
2004
A batch machine or batching processing machine is one that can process several jobs...
A note on ‘parallel machine scheduling with non-simultaneous machine available time’
A note on ‘parallel machine scheduling with non-simultaneous machine available time’
2000
The purpose of this note is to point out that if there are some machines that do not...
Single machine scheduling with discretely controllable processing times
Single machine scheduling with discretely controllable processing times
1997
In the field of machine scheduling problems with controllable processing times, it is...
A crash analysis of scheduling to minimize the number of late jobs
A crash analysis of scheduling to minimize the number of late jobs
1995
The authors present an algorithm for a single machine scheduling problem, in which...
Worst-case analysis of local search heuristics for the one-machine total tardiness problem
Worst-case analysis of local search heuristics for the one-machine total tardiness problem
1990
In this article the worst-case performance of four local search heuristics for the...
Papers per page: