Name
Abstract | ||
|---|---|---|
•The problem of scheduling n jobs on m parallel batching machines is considered.•The goal is to maximize the total profit earned.•We show that the problem can be solved efficiently if each job has the same size.•The problem becomes unary NP-hard if the jobs have different sizes.•For the NP-hard cases, heuristics are given and their performance analyzed. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.ejor.2015.06.051 | European Journal of Operational Research |
Keywords | Field | DocType |
Parallel batching machines,Coordinated production-delivery,Fixed time departure,NP-hard,Heuristics | Mathematical optimization,Unary operation,Integrated production,Scheduling (computing),Third party,Heuristics,Time complexity,Mathematics,Operations management | Journal |
Volume | Issue | ISSN |
247 | 3 | 0377-2217 |
Citations | PageRank | References |
6 | 0.44 | 20 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kai Li | 1 | 84 | 12.99 |
| Zhao-Hong Jia | 2 | 57 | 6.70 |
| Joseph Y. -T. Leung | 3 | 2403 | 400.82 |