Journal: Applied Mathematics (A Journal of Chinese Universities)

Found 15 papers in total
Two-different-units paralleled repairable system with a replaceable facility and repair delay
Two-different-units paralleled repairable system with a replaceable facility and repair delay
2006,
This paper considers a two-different-units paralleled repairable system with a...
Computational complexity of the makespan of the three-stage flow-shop with some batch machines
Computational complexity of the makespan of the three-stage flow-shop with some batch machines
2005,
In this paper, the computational complexity of the three-stage flow-shop with some...
Queueing system with general operation and vacation time
Queueing system with general operation and vacation time
2004,
An M/M/1 queueing system with general operation and vacation time is considered. The...
A two machine sequencing approximation algorithm for maximizing the number of early jobs
A two machine sequencing approximation algorithm for maximizing the number of early jobs
2003,
The problem of scheduling m parallel machines to maximise the number of early jobs is...
Semi on-line scheduling on parallel machines
Semi on-line scheduling on parallel machines
2003,
This paper continues to survey the progress on semi on-line algorithms on parallel...
Semi on-line scheduling on parallel machines (I)
Semi on-line scheduling on parallel machines (I)
2003,
A survey of the progress of semi on-line algorithms on parallel machine scheduling...
Relation between performance potentials and infinitesimal realization factors in closed queueing networks
Relation between performance potentials and infinitesimal realization factors in closed queueing networks
2002,
In this paper, the concept of the infinitesimal realization factor is extended to the...
Semidefinite relaxation of kanpsack problem
Semidefinite relaxation of kanpsack problem
2002,
Knapsack is a classical NP-hard problem. In the last ten years, semi-definite...
Semi-definite relaxation algorithm for the multiple knapsack problem
Semi-definite relaxation algorithm for the multiple knapsack problem
2002,
The multiple knapsack problem denoted by MKP(B,S,m,n) can be defined as follows. A set...
Further discussion on statistical properties of activity flow time in PERT
Further discussion on statistical properties of activity flow time in PERT
2002,
In this paper attempts are made at answering some problems about the statistical...
Robust partial inverse network flow problems
Robust partial inverse network flow problems
2001,
In this paper, a new model for inverse network flow problems, the robust partial...
Sensitivity analysis of performance for M/G/1 queueing systems
Sensitivity analysis of performance for M/G/1 queueing systems
2001,
Queueing systems which are not Markov-type are often used as models to study practical...
Heuristic of scheduling with rejection on two uniform machines
Heuristic of scheduling with rejection on two uniform machines
2000,
A version of two uniform processor scheduling with a special feature that the job may...
An earliness and tardiness problem in single machine scheduling with a common due window
An earliness and tardiness problem in single machine scheduling with a common due window
2000,
This paper considers the following scheduling problem: (P):n jobs demand to be...
The complexity and approximation algorithm of three parallel machines scheduling problem with servers
The complexity and approximation algorithm of three parallel machines scheduling problem with servers
2000,
The problem of scheduling n jobs on 3 parallel identical machines which are tended by...
Papers per page: