The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times |
| |
| Authors: | Dvir Shabtay George Steiner |
| |
| Institution: | (1) Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel;(2) Management Science and Information Systems Area, Michael G. DeGroote School of Business, McMaster University, Hamilton, Ontario, Canada |
| |
| Abstract: | We study the earliness-tardiness scheduling problem on a single machine with due date assignment and controllable processing
times. We analyze the problem with three different due date assignment methods and two different processing time functions.
For each combination of these, we provide a polynomial-time algorithm to find the optimal job sequence, due date values and
resource allocation minimizing an objective function which includes earliness, tardiness, due date assignment, makespan and
total resource consumption costs. |
| |
| Keywords: | Single-machine scheduling Due date assignment Controllable processing times Resource allocation Earliness-tardiness scheduling |
| 本文献已被 SpringerLink 等数据库收录！ |
|
