Skip to main content
SpringerLink
Log in

Scheduling with job-rejection and position-dependent processing times on proportionate flowshops

  • Short Communication
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

We study the classical scheduling problem of minimizing makespan on a proportionate flowshop. Position-dependent job processing times in the most general way are considered. We introduce a polynomial time solution procedure which is more efficient than the one known in the literature. The problem is further extended to allow job-rejection. This more general version is shown to be solved in polynomial time as well.

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.

Institutional subscriptions

Fig. 1

References

  1. Bachman, A., Janiak, A.: Scheduling jobs with position-dependent processing times. J. Oper. Res. Soc. 35, 257–264 (2004)

    Article  MATH  Google Scholar 

  2. Biskup, D.: Single machine scheduling with learning considerations. Eur. J. Oper. Res. 115, 173–178 (1999)

    Article  MATH  Google Scholar 

  3. Cao, Z., Wang, Z., Zhang, Y., Liu, S.: On several scheduling problems with rejection or discretely compressible processing times. Lect. Notes Comput. Sci. 3959, 90–98 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cao, Z., Zhang, Y.: Scheduling with rejection and nonidentical job arrivals. J. Syst. Sci. Complex. 20, 529–535 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. Cheng, Y., Sun, S.: Scheduling linear deteriorating jobs with rejection on a single machine. Eur. J. Oper. Res. 194, 18–27 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cheng, T.C.E., Wang, G.: Single machine scheduling with learning effect considerations. Ann. Oper. Res. 98, 273–290 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gerstl, E., Mosheiov, G.: Scheduling on parallel machines with job-rejection and position-dependent processing times. Inf. Proc. Lett. 112, 743–747 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  8. Ji, M., Cheng, T.C.E.: Scheduling with job-dependent learning effect and multiple rate-modifying activities. Inf. Proc. Lett. 110, 460–463 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  9. Khuller, S., Mestre, J.: An optimal incremental algorithm for minimizing lateness with rejection. Lect. Comput. Sci. 5193, 601–610 (2008)

    Article  MATH  Google Scholar 

  10. Lu, L., Cheng, T.C.E., Yuan, J., Zhang, L.: Bounded single machine parallel-batch scheduling with release dates and rejection. Comput. Oper. Res. 36, 2748–2751 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  11. Lu, L., Zhang, L., Yuan, J.: The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan. Theor. Comput. Sci. 396, 283–289 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  12. Mosheiov, G.: Proportionate flowshop with general position-dependent processing times. Inf. Proc. Lett. 111, 174–177 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  13. Mosheiov, G., Sidney, J.: Scheduling with general job-dependent learning curves. Eur. J. Oper. Res. 147, 665–670 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  14. Ou, J., Zhong, X., Wang, G.: An improved heuristic for parallel machine scheduling with rejection. Eur. J. Oper. Res. 241, 653–661 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  15. Papadimitriou, C. H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Courier Corporation (1982)

  16. Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems, 4th edn. Springer, New York (2012)

    Book  MATH  Google Scholar 

  17. Sengupta, S.: Algorithms and approximation schemes for minimum lateness/tardiness scheduling with rejection. Lect. Notes Comput. Sci. 2748, 79–90 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  18. Shabtay, D.: The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost. Eur. J. Oper. Res. 233, 653–661 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  19. Shabtay, D., Gaspar, N.: Two machine flowshop scheduling with rejection. Comput. Oper. Res. 39, 64–74 (2012)

    Article  MathSciNet  Google Scholar 

  20. Shabtay, D., Gaspar, N., Kaspi, M.: A survey on offline scheduling with rejection. J. Sched. 16, 3–28 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  21. Wang, J.-B., Wang, J.-J.: Flowshop scheduling with a general exponential learning effect. Comput. Oper. Res. 43, 292–308 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  22. Wang, J.-B., Wang, J.-J.: Research on scheduling with job-dependent learning effect and convex resource-dependent processing times. Int. J. Prod. Res. 53, 5826–5836 (2015)

    Article  Google Scholar 

  23. Wang, X.-Y., Zhou, Z., Zhang, X., Ji, P., Wang, J.-B.: Several flow shop scheduling problems with truncated position-based learning effect. Comput. Oper. Res. 40, 2906–2929 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  24. Yang, S.-J.: Parallel machines scheduling with simultaneous considerations of position-dependent deterioration effects and maintenance activities. J. Chin. Inst. Ind. Eng. 28, 270–280 (2011)

    Google Scholar 

  25. Yin, Y., Wu, W.-H., Cheng, T.C.E., Wu, C.-C.: Due-date assignment and single-machine scheduling with generalized position-dependent deteriorating jobs and deteriorating multi-maintenance activities. Int. J. Prod. Res. 52, 2311–2326 (2014)

    Article  Google Scholar 

  26. Yin, Y., Wu, W.-H., Cheng, T.C.E., Wu, C.-C.: Single machine scheduling with time-dependent and position-dependent deteriorating jobs. Int. J. Comput. Integr. Manuf. 28, 781–790 (2015)

    Article  Google Scholar 

  27. Yin, Y., Wu, C.-C., Wu, W.-H., Cheng, S.-R.: The single machine total weighted tardiness scheduling problem with position-based learning effects. Comput. Oper. Res. 39, 1109–1116 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  28. Yu, X., Zhang, Y., Huang, K.: Multi-machine scheduling with general position-based deterioration to minimize total load revisited. Inf. Proc. Lett. 114, 399–404 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  29. Zhang, L., Lu, L., Yuan, J.: Single machine scheduling with release dates and rejection. Eur. J. Oper. Res. 198, 975–978 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  30. Zhang, L., Lu, L., Yuan, J.: Single-machine scheduling under the job rejection constraint. Theor. Comput. Sci. 411, 1877–1882 (2010)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

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

Author information

Authors and Affiliations

  1. Dipartimento di Ingegneria dell’Informazione e Scienze Matematiche, Università di Siena, Siena, Italy

    Alessandro Agnetis

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

    Gur Mosheiov

Authors
  1. Alessandro Agnetis
    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

Agnetis, A., Mosheiov, G. Scheduling with job-rejection and position-dependent processing times on proportionate flowshops. Optim Lett 11, 885–892 (2017). https://doi.org/10.1007/s11590-016-1059-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-016-1059-8

Keywords

Search

Navigation