haku: @author Arkin, E. M. / yhteensä: 2
viite: 1 / 2
« edellinen | seuraava »
Tekijä:Arkin, E. M.
Roundy, R. O.
Otsikko:Weighted-tardiness scheduling on parallel machines with proportional weights
Lehti:Operations Research
1991 : JAN-FEB, VOL. p. 64-81
Asiasana:PRODUCTION SCHEDULING
LINEAR PROGRAMMING
NONLINEAR PROGRAMMING
ALGORITHMS
JOB DESIGN
Kieli:eng
Tiivistelmä:Scheduling a number of jobs on a bank of parallel machines to minimize the total weighted tardiness is considered. The weights of the jobs are supposed to be proportional to processing times. The version of the problem that has general weights has been shown to be strongly NP-complete. It is proved that this version is NP-complete, and a pseudopolynomial time algorithm for solving is given. The running time of the algorithm is quadratic in the number of jobs and linear in the length of the planning horizon, so it should be efficient enough for use in many real-world applications.
SCIMA tietueen numero: 93005
lisää koriin
« edellinen | seuraava »
SCIMA