Name
Title | ||
|---|---|---|
Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks. |
Abstract | ||
|---|---|---|
•We consider a two-agent scheduling problem on parallel machines.•The number of simultaneously processed tasks of agent 2 is restricted.•We focus on the case with unit processing time of agent 1.•We analyze the computational complexity when some parameters have restriction. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.ejor.2017.01.010 | European Journal of Operational Research |
Keywords | Field | DocType |
Scheduling,Parallel machines,Competing agents,Complexity | Mathematical optimization,Job shop scheduling,Machine scheduling,Scheduling (computing),Computer science,Distributed computing,Computational complexity theory | Journal |
Volume | Issue | ISSN |
260 | 2 | 0377-2217 |
Citations | PageRank | References |
1 | 0.35 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Byung-Cheon Choi | 1 | 161 | 17.84 |
| Myoung-Ju Park | 2 | 29 | 7.50 |