Name
Abstract | ||
|---|---|---|
A scheduling problem with a common due-window, earliness and tardiness costs, and identical processing time jobs is studied. We focus on the setting of both (i) job-dependent earliness/tardiness job weights and (ii) parallel uniform machines. The objective is to find the job allocation to the machines and the job schedule, such that the total weighted earliness and tardiness cost is minimized. We study both cases of a non-restrictive (i.e. sufficiently late), and a restrictive due-window. For a given number of machines, the solutions of the problems studied here are obtained in polynomial time in the number of jobs. (C) 2013 Elsevier B.V. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.ejor.2012.12.034 | European Journal of Operational Research |
Keywords | Field | DocType |
Scheduling,Parallel uniform machines,Earliness–tardiness,Assignment problem,Due-window | Mathematical optimization,Job shop scheduling,Tardiness,Scheduling (computing),Assignment problem,Time complexity,Operations management,Mathematics | Journal |
Volume | Issue | ISSN |
229 | 1 | 0377-2217 |
Citations | PageRank | References |
6 | 0.44 | 18 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Enrique Gerstl | 1 | 63 | 7.72 |
| Gur Mosheiov | 2 | 1073 | 105.02 |