DocumentCode
3695940
Title
Batch Scheduling Problem and Algorithm on Parallel Machines with Time Bound
Author
Haixia Li;Xiaoli Gao;Chuanguang Sun
Author_Institution
Shandong Water Polytech., Rizhao, China
Volume
1
fYear
2015
Firstpage
8
Lastpage
10
Abstract
We consider the problem of batch scheduling jobs on m parallel machines with time bound to minimize total weighted completion times. Each batching machine can processing to b jobs simultaneously as a batch. A polynomial-time optimal algorithm for identical job processing time model is presented whose details and proof are given.
Keywords
"Job shop scheduling","Heuristic algorithms","Parallel machines","Algorithm design and analysis","Processor scheduling"
Publisher
ieee
Conference_Titel
Intelligent Human-Machine Systems and Cybernetics (IHMSC), 2015 7th International Conference on
Print_ISBN
978-1-4799-8645-3
Type
conf
DOI
10.1109/IHMSC.2015.108
Filename
7334639
Link To Document