Showing 1 - 10 of 238
Persistent link: https://www.econbiz.de/10011290705
Persistent link: https://www.econbiz.de/10010438008
We consider the online bounded-batch scheduling to minimize total weighted completion time on parallel machines. In the problem, a set of n independent jobs arriving online over time has to be scheduled on m given machines, where the information of each job including its processing time and...
Persistent link: https://www.econbiz.de/10011043221
Persistent link: https://www.econbiz.de/10009772782
Persistent link: https://www.econbiz.de/10011309063
Persistent link: https://www.econbiz.de/10010487456
Persistent link: https://www.econbiz.de/10010485946
Persistent link: https://www.econbiz.de/10012435599
Persistent link: https://www.econbiz.de/10011506199
Persistent link: https://www.econbiz.de/10009530726