Job sequencing and due date assignment in a single machine shop with uncertain processing times |
| |
Authors: | Yu Xia Bintong Chen Jinfeng Yue |
| |
Institution: | 1. Department of Management and Marketing, Middle Tennessee State University, Murfreesboro, TN 37132, USA;2. Department of Management and Operations, Washington State University, Pullman, WA 99164, USA |
| |
Abstract: | This paper considers due date assignment and sequencing for multiple jobs in a single machine shop. The processing time of each job is assumed to be uncertain and is characterized by a mean and a variance with no knowledge of the entire distribution. A heuristic procedure is developed to find job sequence and due date assignment to minimize a linear combination of three penalties: penalty on job earliness, penalty on job tardiness, and penalty associated with long due date assignment. Numerical experiments indicate that the performance of the procedure is stable and robust to job processing time distributions. In addition, the performance improves when the means and variances of job processing times are uncorrelated or negatively correlated or when the penalty of a long due date assignment is significant. |
| |
Keywords: | Scheduling Sequencing Due date assignment Heuristics Distribution-free decision |
本文献已被 ScienceDirect 等数据库收录! |
|