Single-machine scheduling with trade-off between number of tardy jobs and compression cost ∗

@inproceedings{He2006SinglemachineSW,
  title={Single-machine scheduling with trade-off between number of tardy jobs and compression cost ∗},
  author={Yong Jun He and Qi Wei and Chris E. Cheng},
  year={2006}
}
We consider a single-machine scheduling problem in which the job processing times are controllable or compressible. The performance criteria are the compression cost and the number of tardy jobs. For the problem where no tardy jobs are allowed and the objective is to minimize the total compression cost, we present a strongly polynomial time algorithm. For the problem to construct the trade-off curve between the number of tardy jobs and the maximum compression cost, we present a polynomial time… CONTINUE READING

Citations

Publications citing this paper.

References

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

Complexity of the discrete timecost trade - off problem for project networks

R. K. Sarin
Operations Research • 1997

The discrete time-cost trade-off problem revisited

P. De, E. J. Dunne, J. B. Ghosh, C. E. Wells
European Journal of Operational Research, • 1995
View 1 Excerpt

Zdrzalka, A survey of results for sequencing problems with controllable processing times

S. E. Nowicki
Discrete Applied Mathematics, • 1990
View 2 Excerpts

Similar Papers

Loading similar papers…