По вашему запросу найдено документов: 66793
Страница 1 из 6680
On analysis of input data for jobs shop scheduling problem with respect to workers productivity of Job shop scheduling problem,where productivity of workers depends on previous behavior. We consider
Sequence-dependent setup times in a two-machine job-shop with minimizing the schedule lengthThis article addresses the job-shop problem of minimizing the schedule length (makespan
Sequence-dependent setup and removal times in a two-machine job-shop with minimizing the schedule lengthThis article addresses the job-shop problem of minimizing the schedule length (makespan
On analysis of input data for jobs shop scheduling problem with respect to workers productivity of Job shop scheduling problem,where productivity of workers depends on previous behavior. We consider
Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraintsWe consider a scheduling problem with two identical parallel
machines and n jobs. For each
Minimizing functions of infeasibilities in a two-machine flow shop of processing n jobs in the two-machine flow shop we shift the jobs on
the second machine backward in time
Transporting jobs through a two-machine open shopWe consider the two-machine open shop scheduling problem in which the jobs are brought
Sequence-dependent setup times in a two-machine makespan job-shop scheduling problemjob-shop problem of minimizing the schedule length (makespan) for processing n jobs on two machines
Two schemes of the branch-and-bound method for a flow shop total weighted tardiness minimization problemTwo schemes of the branch-and-bound method for a flow shop total weighted tardiness minimization
Two schemes of the branch-and-bound method for a flow shop total weighted tardiness minimization problemTwo schemes of the branch-and-bound method for a flow shop total weighted tardiness minimization
Страница 1 из 6680
Фасеты
Партнеры
Индексация
