Abstract
A classical single machine minmax common due-date assignment (CON) problem is studied. The problem is extended (independently) to the following settings: (1) general position-dependent job processing times are assumed, and an efficient O(n 4) solution procedure is introduced; (2) the option of job rejection is allowed, and this case is shown to be solved in O(n 5); (3) a deterioration effect is considered, and an O(n 2) solution algorithm is proposed; (4) parallel uniform machines are considered; and (5) the machine setting is that of a permutation flowshop. The last two settings are known to be NP hard, and efficient heuristic procedures are introduced and shown numerically to produce very small optimality gaps.
| Original language | American English |
|---|---|
| Pages (from-to) | 408-424 |
| Number of pages | 17 |
| Journal | Engineering Optimization |
| Volume | 53 |
| Issue number | 3 |
| DOIs | |
| State | Published - 2021 |
Bibliographical note
Funding Information:This work was supported by Israel Science Foundation [grant number 2505/19]. The first author was also supported by the Charles I. Rosen Chair of Management and by the Recanati Fund of the School of Business Administration, The Hebrew University, Jerusalem, Israel.
Publisher Copyright:
© 2020 Informa UK Limited, trading as Taylor & Francis Group.
Keywords
- Scheduling
- flowshop
- job rejection
- position-dependent processing times
- uniform machines