Journal: Journal of Shenyang Normal University

Found 8 papers in total
The weighted center and weighted median of network location
The weighted center and weighted median of network location
2005,
We give a model of location with weighted vertices in this paper. According to the...
Single machine scheduling with start time dependent processing times
Single machine scheduling with start time dependent processing times
2005,
This paper discusses a single machine scheduling problem with processing time...
Storage model of short-supply not allowing under condition of limited storage capacity and time-needing producing
Storage model of short-supply not allowing under condition of limited storage capacity and time-needing producing
2005,
Optimum solutions of most models of storage are discussed under hypothesis that the...
The no-idle flowshop scheduling problem with discounted weight
The no-idle flowshop scheduling problem with discounted weight
2003,
This paper discusses the no-idle permutation flowshop scheduling problem, whose...
Optimal algorithms for the no-wait flowshop scheduling problem with discount weights
Optimal algorithms for the no-wait flowshop scheduling problem with discount weights
2003,
This paper discusses the no-wait flowshop scheduling problem, whose objective function...
Dynamic programming algorithm of a sort of optimal assignment problem
Dynamic programming algorithm of a sort of optimal assignment problem
2002,
This paper presents a sort of dynamic programming algorithm for the following...
An optimal algorithm for solving a scheduling problem of minimising the weighted total job time with discounted factor
An optimal algorithm for solving a scheduling problem of minimising the weighted total job time with discounted factor
2002,
In this paper, we discuss the group scheduling problem on a single machine whose...
Scheduling problem with sequence-dependent setup times
Scheduling problem with sequence-dependent setup times
2002,
In this paper the scheduling problem with sequence-dependent setup times is discussed....
Papers per page: