Name
Abstract | ||
|---|---|---|
In this paper, a multi-period assignment problem is studied that arises as part of a weekly planning problem at mail processing and distribution centers. These facilities contain a wide variety of automation equipment that is used to cancel, sort, and sequence the mail. The input to the problem is an equipment schedule that indicates the number of machines required for each job or operation during the day. This result is then post-processed by solving a multi-period assignment problem to determine the sequence of operations for each machine. Two criteria are used for this purpose. The first is to minimize the number of startups, and the second is to minimize the number of machines used per operation. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.ejor.2004.07.051 | European Journal of Operational Research |
Keywords | Field | DocType |
Multi-period assignment problem,Machine scheduling,Total unimodularity,Heuristics | Mathematical optimization,Heuristic,Scheduling (computing),sort,Generalized assignment problem,Assignment problem,Heuristics,Integer programming,Time complexity,Mathematics | Journal |
Volume | Issue | ISSN |
170 | 2 | 0377-2217 |
Citations | PageRank | References |
3 | 0.44 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xinhui Zhang | 1 | 25 | 3.03 |
| Jonathan F. Bard | 2 | 1428 | 144.29 |