Polynomially solvable cases for scheduling deteriorating jobs with rejection

@article{Liu2013PolynomiallySC,
  title={Polynomially solvable cases for scheduling deteriorating jobs with rejection},
  author={Ming Liu and Chengbin Chu},
  journal={2013 10th IEEE INTERNATIONAL CONFERENCE ON NETWORKING, SENSING AND CONTROL (ICNSC)},
  year={2013},
  pages={318-321}
}
This paper considers the problem of scheduling proportionally deteriorating jobs with rejection on a single machine. Deteriorating job means that its actual processing time is a increasing function on its execution starting time. In this setting, jobs can be rejected by paying penalties. The objective is to minimize the makespan plus the total penalty incurred by rejecting jobs. It is known that this problem is NP-hard [13]. We show some polynomial-time solvable cases and propose the… CONTINUE READING

From This Paper

Topics from this paper.
0 Citations
15 References
Similar Papers

References

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

A note on the optimal sequence position for a ratemodifying activity under simple linear deterioration

  • E. Lodree, C. Gerger
  • European Journal of Operational Research
  • 2010
1 Excerpt

Scheduling: Theory, Algorithms, and Systems (Second Editon)

  • M. Pinedo
  • 2000
1 Excerpt

Scheduling with time dependent processing times: Review and extentions

  • B. Alidaee, N. Womer
  • Journal of the Operational Research Society
  • 1999
1 Excerpt

Similar Papers

Loading similar papers…