The problem of minimizing the maximal weighted absolute lateness (MWAL) is known to be NP-hard. The due-date assignment part of MWAL for a given sequence has been shown in the literature to be solved on a single machine in O(n 2) time. In this paper, we study a more general version of the problem with asymmetric cost (nonidentical earliness and tardiness weights). We introduce a linear-programming-based O(n) solution for this case. We also extend our proposed solution procedure to other machine settings such as flow-shop and parallel machines.
Bibliographical noteFunding Information:
Acknowledgments—This paper was supported in part by The Recanati Fund of the School of Business Administration, The Hebrew University, Jerusalem, Israel.
- Due-date assignment
- Parallel machines
- Single machine