Skip to main content
SpringerLink
Log in

A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection

  • Short Note
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We study a scheduling problem with the objective of minimizing total absolute deviation of completion times (TADC). TADC is considered here in the most general form studied so far: the machine setting is that of parallel unrelated, job processing time are assumed to be position-dependent with no restrictions on the functional form, and the option of processing only a subset of the jobs (i.e., job-rejection) is allowed. We show that minimizing TADC in this very general form remains polynomially solvable in the number of jobs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2

References

  • Agnetis, A., Billaut, J.-C., Gawiejnowicz, S., Pacciarelli, D., & Soukhal, A. (2014). Multiagent scheduling: Models and algorithms. Berlin: Springer.

    Book  Google Scholar 

  • Agnetis, A., & Mosheiov, G. (2017). Scheduling with job-rejection and position-dependent processing times on proportionate flowshops. Optimization Letters, 11, 885–892.

    Article  Google Scholar 

  • Ben-Yehoshua, Y., Hariri, E., & Mosheiov, G. (2015). A note on minimising total absolute deviation of job completion times on a two-machine no-wait proportionate flowshop. International Journal of Production Research, 53, 5717–5724.

    Article  Google Scholar 

  • Chen, S. H., Mani, V., & Chen, Y. H. (2015). Bi-criterion single machine scheduling problem with a past-sequence-dependent setup times and learning effect. In Proceedings of the 2015 IEEE IEEM (pp. 185–189).

  • Gawiejnowicz, S. (2008). Time-dependent scheduling. Berlin, Heidelberg: Springer.

    Book  Google Scholar 

  • Gerstl, E., Mor, B., & Mosheiov, G. (2017). Minmax scheduling with acceptable lead-times: Extensions to position-dependent processing times, due-window and job rejection. Computers and Operations Research, 83, 150–156.

    Article  Google Scholar 

  • Gerstl, E., & Mosheiov, G. (2017). Single machine scheduling problems with generalized due-dates and job-rejection. International Journal of Operations Research, 55, 3164–3172.

    Google Scholar 

  • Huang, X., & Wang, M. Z. (2011). Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties. Applied Mathematical Modeling, 35, 1349–1353.

    Article  Google Scholar 

  • Ji, M., & Cheng, T. C. E. (2010). Scheduling with job-dependent learning effects and multiple rate-modifying activities. Information Processing Letters, 110, 460–463.

    Article  Google Scholar 

  • Kanet, J. (1981). Minimizing variation of flow time in single machine systems. Management Science, 27, 1453–1459.

    Article  Google Scholar 

  • Koulamas, C., & Kyparisis, G. J. (2008). Single machine scheduling problems with past-sequence-dependent setup times. European Journal of Operational Research, 187, 1045–1049.

    Article  Google Scholar 

  • Li, Y., Li, G., Sun, L., & Xu, Z. (2009). Single machine scheduling of deteriorating jobs to minimize total absolute differences in completion times. International Journal of Production Economics, 118, 424–429.

    Article  Google Scholar 

  • Mani, V., Chang, P. C., & Chen, S. H. (2011). Single-machine scheduling with past-sequence-dependent setup times and learning effects: A parametric analysis. International Journal of Systems Science, 42, 2097–2102.

    Article  Google Scholar 

  • Mor, B., & Mosheiov, G. (2011). Total absolute deviation of job completion times on uniform and unrelated machines. Computers and Operations Research, 38, 660–665.

    Article  Google Scholar 

  • Mor, B., & Mosheiov, G. (2016). Minimizing maximum cost on a single machine with two competing agents and job rejection. Journal of The Operational Research Society, 67, 1524–1531.

    Article  Google Scholar 

  • Mosheiov, G. (2008). Minimizing total absolute deviation of job completion times: Extensions to position-dependent processing times and parallel identical machines. Journal of the Operational Research Society, 59, 1422–1424.

    Article  Google Scholar 

  • Mosheiov, G., & Strusevich, V. (2017). Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow. Naval Research Logistics, 64, 217–224.

    Article  Google Scholar 

  • Oron, D. (2008). Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times. Computers and Operations Research, 35, 2071–2078.

    Article  Google Scholar 

  • Ou, J., Zhong, X., & Wang, G. (2015). An improved heuristic for parallel machine scheduling with rejection. European Journal of Operational Research, 241, 653–661.

    Article  Google Scholar 

  • Pei, J., Cheng, B., Liu, X., Pardalos, P. M., & Kong, M. (2017). Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time. Annals of Operations Research. https://doi.org/10.1007/s10479-017-2481-8.

  • Rudek, R. (2012). Scheduling problems with position dependent job processing times: Computational complexity results. Annals of Operations Research, 196, 491–516.

    Article  Google Scholar 

  • Shabtay, D., Gaspar, N., & Kaspi, M. (2013). A survey on offline scheduling with rejection. Journal of Scheduling, 16, 3–28.

    Article  Google Scholar 

  • Stirzaker, D. (1994). Elementary probability. Cambridge: Cambridge University Press.

    Google Scholar 

  • Sun, L.-H., Cui, K., Chen, J.-H., Wang, J., & He, X.-C. (2013). Research on permutation flow shop scheduling problems with general position-dependent learning effects. Annals of Operations Research, 211, 473–480.

    Article  Google Scholar 

  • Thevenin, S., Zufferey, N., & Widmer, M. (2015). Metaheuristics for a scheduling problem with rejection and tardiness penalties. Journal of scheduling, 18, 89–105.

    Article  Google Scholar 

  • Wang, D. J., Yin, Y., & Liu, M. (2016). Bicriteria scheduling problems involving job rejection, controllable processing times and rate-modifying activity. International Journal of Production Research, 54, 3691–3705.

    Article  Google Scholar 

  • Yang, D. L., & Kuo, W. H. (2009). Single machine scheduling with both deterioration and learning effects. Annals of OR, 172, 315–327.

    Article  Google Scholar 

  • Yang, D. L., & Kuo, W. H. (2010). Some scheduling problems with deteriorating jobs and learning effects. Computers & Industrial Engineering, 58, 25–28.

    Article  Google Scholar 

  • Zhong, X., Pan, Z., & Jiang, D. (2017). Scheduling with release times and rejection on two parallel machines. Journal of combinatorial Optimization, 33, 934–944.

    Article  Google Scholar 

Download references

Acknowledgements

This research was supported by the Israel Science Foundation (Grant No. 1286/14). The second author was also supported by the Charles I. Rosen Chair of Management, and by The Recanati Fund of The School of Business Administration, The Hebrew University, Jerusalem, Israel.

Author information

Authors and Affiliations

  1. Department of Economics and Business Administration, Ariel University, 40700, Ariel, Israel

    Baruch Mor

  2. School of Business Administration, The Hebrew University, 91905, Jerusalem, Israel

    Gur Mosheiov

Authors
  1. Baruch Mor
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gur Mosheiov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gur Mosheiov.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mor, B., Mosheiov, G. A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection. Ann Oper Res 271, 1079–1085 (2018). https://doi.org/10.1007/s10479-018-2779-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-018-2779-1

Keywords

Search

Navigation