Minimizing total weighted flow time of a set of jobs with interval processing times. The scheduling objective is to minimize the total weighted flow time of all
n jobs, where there is a weight
Stability polyhedra of optimal permutation of jobs servicing of
n customers by a single server, provided that the duration of jobs servicing may assume any real
Sequencing jobs with uncertain processing times and minimizing the weighted total flow time in polynomial time of the number
n=|J|
of jobs. If there is no a domination within some subset of set J
Minimizing total weighted completion time with uncertain data: a stability approach the total weighted completion time for the
n jobs. As a solution concept to such a scheduling problem
Sequence-dependent setup and removal times in a two-machine job-shop with minimizing the schedule length) for
processing
n jobs on two machines with sequence-dependent setup and removal times. The processing of each job