The two-machine flow shop problem with delays and the one-machine total tardiness problem

@inproceedings{Yu2013TheTF,
  title={The two-machine flow shop problem with delays and the one-machine total tardiness problem},
  author={Wenci Yu},
  year={2013}
}
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 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 general… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 43 references

Flow and open shop scheduling on two machines with transportation times and machine-independent processing times is NP-hard

  • R.J.M. Vaessens, M. Dell'Amico
  • Preprint
  • 1995
Highly Influential
6 Excerpts

Single facility scheduling with two operations per job and time-lags

  • J .N.D. Gupta
  • Preprint,
  • 1994
Highly Influential
8 Excerpts

An improved heuristic for one-machine scheduling problem with minimum delays chains precedence constraints

  • D. Du, J. Han
  • Preprint
  • 1995
1 Excerpt

Similar Papers

Loading similar papers…