Augmentations of Consistent Partial orders for the one-machine Total Tardiness Problem

@article{Yu1996AugmentationsOC,
  title={Augmentations of Consistent Partial orders for the one-machine Total Tardiness Problem},
  author={Wenci Yu},
  journal={Discrete Applied Mathematics},
  year={1996},
  volume={68},
  pages={189-202}
}
A partial order on a job set is called consistent, if it has a linear extension which is an optimal solution to the total tardiness problem of the job set. The concept of proper augmentations of consistent partial orders is based on Emmons’ well-known dominance theorem. In this paper, we address the question of whether the proper augmentation of a consistent partial order always results in a partial order which is also consistent. By giving an example, we show that this need not be true in… CONTINUE READING