Skip to main content
Log in

Mirror scheduling problems with early work and late work criteria

Journal of Scheduling Aims and scope Submit manuscript

Abstract

We give a definition of a class of mirror scheduling problems, review existing representatives of this class and demonstrate that an identical parallel machine scheduling problem with precedence constraints and an upper bound on the makespan to minimize (maximize) the total weighted early work and the same problem with modified due dates, reversed precedence constraints and the objective function of minimizing (maximizing) the total weighted late work are mirror problems.

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  • Abasian, F., Ranjbar, M., Salari, M., Davari, M., & Khatami, S. M. (2014). Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays. Applied Mathematical Modelling, 38(15–16), 3975–3986.

    Article  Google Scholar 

  • Aloulou, M. A., Kovalyov, M. Y., & Portmann, M.-C. (2004). Maximization problems in single machine scheduling. Annals of Operations Research, 129(1–4), 21–32.

    Article  Google Scholar 

  • Ben-Yehoshua, Y., & Mosheiov, G. (2016). A single machine scheduling problem to minimize total early work. Computers and Operations Research, 73, 115–118.

    Article  Google Scholar 

  • Błażewicz, J. (1984). Scheduling preemptible tasks on parallel processors with information loss. Technique et Science Informatiques, 3(6), 415–420.

    Google Scholar 

  • Chen, X., Sterna, M., Han, X., & Błażewicz, J. (2016). Scheduling on parallel identical machines with late work criterion: Offline and online cases. Journal of Scheduling, 19(6), 729–736.

    Article  Google Scholar 

  • Cheng, T. C. E., & Ding, Q. (1998). The complexity of scheduling starting time dependent tasks with release times. Information Processing Letters, 65(2), 75–79.

    Article  Google Scholar 

  • Cheng, T. C. E., Ding, Q., & Lin, B. M. T. (2004). A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research, 152(1), 1–13.

    Article  Google Scholar 

  • Du, J., & Leung, J. Y.-T. (1990). Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15(3), 483–495.

    Article  Google Scholar 

  • Gafarov, E. R., Lazarev, A. A., & Werner, F. (2012). Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one. Annals of Operations Research, 196(1), 247–261.

    Article  Google Scholar 

  • Hardy, G. H., Littlewood, J. E., & Pólya, G. (1934). Inequalities. Cambridge: Cambridge University Press.

    Google Scholar 

  • Janiak, A., Kovalyov, M. Y., & Marek, M. (2007). Soft due window assignment and scheduling on parallel machines. IEEE Transactions on Systems, Man and Cybernetics-Part A: Systems and Humans, 37(5), 614–620.

    Article  Google Scholar 

  • Koulamas, C. (2015). A note on scheduling problems with competing agents and earliness minimization objectives. European Journal of Operational Research, 245(3), 875–876.

    Article  Google Scholar 

  • Kovalyov, M. Y., Potts, C. N., & Van Wassenhove, L. N. (1994). A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work. Mathematics of Operations Research, 19(1), 86–93.

    Article  Google Scholar 

  • Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (1993). Sequencing and scheduling: Algorithms and complexity. In S. C. Graves, A. H. G. RinnooyKan, & P. H. Zipkin (Eds.), Logistics of production and inventory. Handbook in operations research and management science (Vol. 4, pp. 445–452). Amsterdam: Elsevier.

    Chapter  Google Scholar 

  • Martello, S., & Toth, P. (1990). Knapsack problems: Algorithms and computer implementation. New York, NY: Wiley.

    Google Scholar 

  • Potts, C. N., & Van Wassenhove, L. N. (1992). Single machine scheduling to minimize total late work. Operations Research, 40(3), 586–595.

    Article  Google Scholar 

  • Ranjbar, M., Hosseinabadi, S., & Abasian, F. (2013). Minimizing total weighted late work in the resource-constrained project scheduling problem. Applied Mathematical Modelling, 37(23), 9776–9785.

    Article  Google Scholar 

  • Sterna, M. (2011). A survey of scheduling problems with late work criteria. Omega, 39(2), 120–129.

    Article  Google Scholar 

  • Tadei, R., Gupta, J. N. D., Della Croce, F., & Cortesi, M. (1998). Minimizing makespan in the two-machine flow-shop with release times. Journal of the Operational Research Society, 49(5–6), 77–85.

    Article  Google Scholar 

  • Xu, Z., Zou, Y., & Kong, X. (2015). Metaheuristic algorithms for parallel identical machines scheduling problem with weighted late work criterion and common due date. SpringerPlus, 24(782), 1–13.

    Google Scholar 

Download references

Acknowledgements

This research was partially supported by Natural Science Foundation of Liaoning (No. 2019-MS-170), Poland-China Scientific and Technological Cooperation Project 37-19 and the part of Poznań University of Technology Grant No. 09/91/SBAD/0681 designated to the Poland-China Scientific and Technological Cooperation.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sergey Kovalev.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chen, X., Kovalev, S., Sterna, M. et al. Mirror scheduling problems with early work and late work criteria. J Sched 24, 483–487 (2021). https://doi.org/10.1007/s10951-020-00636-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-020-00636-9

Keywords

Navigation