Online Bi-Criteria Scheduling on Batch Machines with Machine Costs
We consider online scheduling with bi-criteria on parallel batch machines, where the batch capacity is unbounded. In this paper, online means that jobs’ arrival is over time. The objective is to minimize the maximum machine cost subject to the makespan being at its minimum. In unbounded pa...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2019-10-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/7/10/960 |