Skip to main content
SpringerLink
Log in

Single machine lot scheduling with optional job-rejection

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

We consider single machine lot scheduling problems. A number of customer orders of different sizes may be processed in the same lot. Splitting orders between consecutive lots is allowed. Three scheduling measures are considered: makespan, total completion time and total weighted completion time. In all cases, the goal is minimizing the relevant scheduling measure, subject to an upper bound on the total permitted rejection cost. All three problems studied here are NP-hard. We introduce efficient pseudo-polynomial dynamic programming algorithms for all cases. Our numerical tests indicate that the proposed algorithms can solve efficiently large-size problems.

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

Similar content being viewed by others

References

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

    Article  MathSciNet  Google Scholar 

  • Cordone R, Hosteins P (2019) A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization. Comput Oper Res 102:130–140

    Article  MathSciNet  Google Scholar 

  • Epstein L, Zebedat-Haider HJ (2014) Online scheduling with rejection and reordering: exact algorithms for unit size jobs. J Combin Optim 28:875–892

    Article  MathSciNet  Google Scholar 

  • Epstein E, Zebedat-Haider H (2016) Online scheduling of unit jobs on three machines with rejection: a tight result. Inf Process Lett 116:252–255

    Article  MathSciNet  Google Scholar 

  • Fiszman S, Mosheiov G (2018) Minimizing total load on a proportionate flowshop with position-dependent processing times and job rejection. Inf Process Lett 132:39–43

    Article  MathSciNet  Google Scholar 

  • Gerstl E, Mosheiov G (2017) Single machine scheduling problems with generalised due-dates and job-rejection. Int J Prod Res 55:3164–3172

    Article  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. Comput Oper Res 83:150–156

    Article  MathSciNet  Google Scholar 

  • Hermelin D, Pinedo M, Shabtay D, Talmon N (2019) On the parameterized tractability of single machine scheduling with rejection. Eur J Oper Res 273:67–73

    Article  MathSciNet  Google Scholar 

  • Hou Y-T, Yang D-L, Kuo W-H (2014) Lot scheduling on a single machine. Inf Process Lett 114:718–722

    Article  MathSciNet  Google Scholar 

  • Kong M, Liu X, Pei J, Zhou Z, Pardalos PM (2019) Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine. Optim Lett. https://doi.org/10.1007/s11590-019-01389-x

    Article  MATH  Google Scholar 

  • Kovalyov MY, Mosheiov G, Sesok D (2019) Comments on “Proportionate flowshop with general position dependent processing times” [Inf. Process. Lett. 111 (2011) 174-177] and “Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection” [Inf. Process. Lett. 132 (2018) 39-43]. Inf Process Lett 147:1–2

    Article  Google Scholar 

  • Lu L, Zhang L (2017) Single-machine scheduling with production and rejection costs to minimize the maximum earliness. J Combin Optim 34:331–342

    Article  MathSciNet  Google Scholar 

  • Ma R, Yuan JJ (2017) Online scheduling to minimize the total weighted completion time plus the rejection cost. J Combin Optim 34:483–503

    Article  MathSciNet  Google Scholar 

  • Mor B (2018) Minmax scheduling problems with common due-date and completion time penalty. J Combin Optim. https://doi.org/10.1007/s10878-018-0365-8

    Article  MATH  Google Scholar 

  • Mor B (2020) Single-machine lot scheduling with variable lot processing times. Eng Optim. https://doi.org/10.1080/0305215X.2020.1722119

    Article  Google Scholar 

  • Mor B, Mosheiov G (2016) Minimizing maximum cost on a single machine with two competing agents and job rejection. J Oper Res Soc 67:1524–1531

    Article  Google Scholar 

  • Mor B, Mosheiov G (2018) 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

    Article  MathSciNet  Google Scholar 

  • Mor B, Shapira D (2019a) Improved algorithms for scheduling on proportionate flowshop with job-rejection. J Oper Res Soc 70:1997–2003

    Article  Google Scholar 

  • Mor B, Shapira D (2019b) Scheduling with regular performance measures and optional job rejection on a single machine. J Oper Res Soc. https://doi.org/10.1080/01605682.2019.1621222

    Article  Google Scholar 

  • Mor B, Shapira D (2020) Regular scheduling measures on proportionate flowshop with job rejection. Comput Appl Math 39:1–14

    Article  MathSciNet  Google Scholar 

  • Mor B, Mosheiov G (2020) A note: flowshop scheduling with linear deterioration and job-rejection. 4OR-Q J Oper Res. https://doi.org/10.1007/s10288-020-00436-z

    Article  MATH  Google Scholar 

  • Mor B, Mosheiov G, Shapira D (2019) Flowshop scheduling with learning effect and job rejection. J Sched. https://doi.org/10.1007/s10951-019-00612-y

    Article  MATH  Google Scholar 

  • Mosheiov G, Pruwer S (2020) On the minmax common-due-date problem: extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops. Eng Optim. https://doi.org/10.1080/0305215X.2020.1735380

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  • Ou J, Zhong X, Li C-L (2016) Faster algorithms for single machine scheduling with release dates and rejection. Inf Process Lett 116:503–507

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  • Wang D, Yin Y, Cheng TCE (2018) Parallel-machine rescheduling with job unavailability and rejection. Omega 81:246–260

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  • Zhang L, Lu L, Li S (2016) New results on two-machine flow-shop scheduling with rejection. J Combin Optim 31:1493–1504

    Article  MathSciNet  Google Scholar 

  • Zhang X, Xu D, Du D, Wu C (2018) Approximation algorithms for precedence-constrained identical machine scheduling with rejection. J Combin Optim 35:318–330

    Article  MathSciNet  Google Scholar 

  • Zhang E, Liu M, Zheng F, Xu Y (2019) Single machine lot scheduling to minimize the total weighted (discounted) completion time. Inf Process Lett 142:46–51

    Article  MathSciNet  Google Scholar 

  • Zhong X, Pan Z, Jiang D (2017) Scheduling with release times and rejection on two parallel machines. J Combin Optim 33:934–944

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The second author was supported by the Israel Science Foundation (grant No. 2505/19), by the Recanati Fund of The School of Business Administration, and by Charles I. Rosen Chair of Management, The Hebrew University of 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

  3. Department of Computer Science, Ariel University, 40700, Ariel, Israel

    Dana Shapira

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

  3. Dana Shapira
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gur Mosheiov.

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

Mor, B., Mosheiov, G. & Shapira, D. Single machine lot scheduling with optional job-rejection. J Comb Optim 41, 1–11 (2021). https://doi.org/10.1007/s10878-020-00651-8

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-020-00651-8

Keywords

Search

Navigation