Advertisement

Tackling Common Due Window Problem with a Two-Layered Approach

  • Abhishek Awasthi
  • Jörg Lässig
  • Thomas Weise
  • Oliver Kramer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10043)

Abstract

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.

References

  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. 2.
    Biskup, D., Feldmann, M.: On scheduling around large restrictive common due windows. Eur. J. Oper. Res. 162(3), 740–761 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 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)CrossRefGoogle Scholar
  6. 6.
    Kim, J.: Genetic algorithm stopping criteria for optimization of construction resource scheduling problems. Constr. Manag. Econ. 31(1), 3–19 (2013)CrossRefGoogle Scholar
  7. 7.
    Krämer, F., Lee, C.: Due window scheduling for parallel machines. Math. Comput. Model. 20(2), 69–89 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Lässig, J., Sudholt, D.: General upper bounds on the runtime of parallel evolutionary algorithms. Evol. Comput. 22(3), 405–437 (2014)CrossRefzbMATHGoogle Scholar
  9. 9.
    Salamon, P., Sibani, P., Frost, R.: Facts, Conjectures, and Improvements for Simulated Annealing. Society for Industrial and Applied Mathematics, Philadelphia (2002)CrossRefzbMATHGoogle Scholar
  10. 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 CrossRefGoogle Scholar
  11. 11.
    Yeung, W., Oguz, C., Cheng, T.: Single-machine scheduling with a common due window. Comput. Oper. Res. 28(2), 157–175 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 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)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  • Abhishek Awasthi
    • 1
  • Jörg Lässig
    • 1
  • Thomas Weise
    • 2
  • Oliver Kramer
    • 3
  1. 1.Department of Computer ScienceUniversity of Applied Sciences Zittau/GörlitzGörlitzGermany
  2. 2.School of Computer Science and TechnologyUniversity of Science and Technology of ChinaHefeiChina
  3. 3.Department of Computing ScienceCarl von Ossietzky University of OldenburgOldenburgGermany

Personalised recommendations