Skip to main content

Tackling Common Due Window Problem with a Two-Layered Approach

  • 1105 Accesses

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 10043)


This work presents a polynomial algorithm to optimize any given job sequence for the Common Due-Window (CDW) Problem. The CDW problem comprises of scheduling and sequencing a set of jobs against a due-window to minimize the total weighted earliness/tardiness penalty. This due-window is defined by the left and right common due-dates. Jobs that finish before (after) the left (right) due-date are termed as early (tardy) jobs. We present an exact polynomial algorithm for optimally scheduling a given fixed job sequence for a single machine with the runtime complexity of O(n), where n is the number of jobs. The linear algorithm and a heuristic based on the V-shaped property are then incorporated with a modified Simulated Annealing (SA) algorithm to obtain the optimal/near-optimal solutions. We carry out computational experiments to demonstrate the utility of our approach over the benchmark instances and previous work on this problem.


  • Exact Polynomial Algorithm
  • Runtime Complexity
  • Benchmark Instances
  • Optimal Schedule
  • Metropolis Acceptance Probability

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-319-48749-6_59
  • Chapter length: 10 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
USD   89.00
Price excludes VAT (USA)
  • ISBN: 978-3-319-48749-6
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   119.99
Price excludes VAT (USA)
Fig. 1.


  1. Awasthi, A., Lässig, J., Kramer, O., Weise, O.: Common due-window problem: polynomial algorithms for a given processing sequence. In: IEEE Symposium on Computational Intelligence in Production and Logistics Systems (IEEE SSCI-CIPLS), pp. 32–39 (2014)

    Google Scholar 

  2. Biskup, D., Feldmann, M.: On scheduling around large restrictive common due windows. Eur. J. Oper. Res. 162(3), 740–761 (2005)

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. Janiak, A., Janiak, W., Kovalyov, M., Kozan, E., Pesch, E.: Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs. Inf. Sci. 224, 109–117 (2013)

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. Janiak, A., Janiak, W., Krysiak, T., Kwiatkowski, T.: A survey on scheduling problems with due windows. Eur. J. Oper. Res. 242(2), 347–357 (2015)

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. Ji, M., Chen, K., Ge, J., Cheng, T.: Group scheduling and job-dependent due window assignment based on a common flow allowance. Comput. Ind. Eng. 68, 35–41 (2014)

    CrossRef  Google Scholar 

  6. Kim, J.: Genetic algorithm stopping criteria for optimization of construction resource scheduling problems. Constr. Manag. Econ. 31(1), 3–19 (2013)

    CrossRef  Google Scholar 

  7. Krämer, F., Lee, C.: Due window scheduling for parallel machines. Math. Comput. Model. 20(2), 69–89 (1994)

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. Lässig, J., Sudholt, D.: General upper bounds on the runtime of parallel evolutionary algorithms. Evol. Comput. 22(3), 405–437 (2014)

    CrossRef  MATH  Google Scholar 

  9. Salamon, P., Sibani, P., Frost, R.: Facts, Conjectures, and Improvements for Simulated Annealing. Society for Industrial and Applied Mathematics, Philadelphia (2002)

    CrossRef  MATH  Google Scholar 

  10. Wan, G.: Single machine common due window scheduling with controllable job processing times. In: Dress, A., Xu, Y., Zhu, B. (eds.) COCOA 2007. LNCS, vol. 4616, pp. 279–290. Springer, Heidelberg (2007). doi:10.1007/978-3-540-73556-4_30

    CrossRef  Google Scholar 

  11. Yeung, W., Oguz, C., Cheng, T.: Single-machine scheduling with a common due window. Comput. Oper. Res. 28(2), 157–175 (2001)

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. Yeung, W., Choi, T., Cheng, T.: Optimal scheduling of a single-supplier single-manufacturer supply chain with common due windows. IEEE Trans. Autom. Control 55(12), 2767–2777 (2010)

    CrossRef  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations


Corresponding author

Correspondence to Abhishek Awasthi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Awasthi, A., Lässig, J., Weise, T., Kramer, O. (2016). Tackling Common Due Window Problem with a Two-Layered Approach. In: Chan, TH., Li, M., Wang, L. (eds) Combinatorial Optimization and Applications. COCOA 2016. Lecture Notes in Computer Science(), vol 10043. Springer, Cham.

Download citation

  • DOI:

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-48748-9

  • Online ISBN: 978-3-319-48749-6

  • eBook Packages: Computer ScienceComputer Science (R0)