Loading...
Please wait, while we are loading the content...
Similar Documents
A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan
| Content Provider | Semantic Scholar |
|---|---|
| Author | Ozturk, Onur Begen, Mehmet A. Zaric, Gregory S. |
| Copyright Year | 2017 |
| Abstract | In this paper, we present a branch and bound algorithm for the parallel batch scheduling of jobs having different processing times, release dates and unit sizes. There are identical machines with a fixed capacity and the number of jobs in a batch cannot exceed the machine capacity. All batched jobs are processed together and the processing time of a batch is given by the greatest processing time of jobs in that batch. We compare our method to a mixed integer program as well as a method from the literature that is capable of optimally solving instances with a single machine. Computational experiments show that our method is much more efficient than the other two methods in terms of solution time for finding the optimal solution. |
| Starting Page | 1815 |
| Ending Page | 1831 |
| Page Count | 17 |
| File Format | PDF HTM / HTML |
| DOI | 10.1080/00207543.2016.1253889 |
| Alternate Webpage(s) | http://www.employees.org/~mabegen/files/unit_sch.pdf |
| Alternate Webpage(s) | https://doi.org/10.1080/00207543.2016.1253889 |
| Volume Number | 55 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |