Journal
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
Volume 54, Issue 11, Pages 1222-1224Publisher
PALGRAVE PUBLISHERS LTD
DOI: 10.1057/palgrave.jors.2601624
Keywords
scheduling; due-date assignment; single machine; parallel machines
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available