An O(n) algorithm for the variable common due date,minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines |
| |
| Authors: | S.S. Panwalkar Christos Koulamas |
| |
| Affiliation: | 1. Carey Business School, Johns Hopkins University, 100 International Drive, Baltimore, MD 21202, United States;2. Department of Decision Sciences and Information Systems, Florida International University, Miami, FL 33199, United States |
| |
| Abstract: | We consider the ordinary NP- hard two-machine flow shop problem with the objective of determining simultaneously a minimal common due date and the minimal number of tardy jobs. We present an O(n2) algorithm for the problem when the machines are ordered, that is, when each job has its smaller processing time on the first (second) machine. We also discuss the applicability of the proposed algorithm to the corresponding single-objective problem in which the common due date is given. |
| |
| Keywords: | Scheduling Flow shop Multi-criteria problems |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
