Skip to main content
Have a personal or library account? Click to login
Scheduling problems with a common due window assignment: A survey Cover

Scheduling problems with a common due window assignment: A survey

International Journal of Applied Mathematics and Computer Science
Volume 23 (2013): Issue 1 (March 2013)
By: ,   and    
Open Access
|Mar 2013
References

References

  1. Azizoglu, M. and Webster, S. (1997). Scheduling about an unrestricted common due window with arbitrary earliness/tardiness penalty rates,(11): 1001-1006.
    Open DOISearch in Google Scholar
  2. Baker, K.R. and Scudder, G.D. (1990). Sequencing with earliness and tardiness penalties: A review,(1): 22-36.
    Open DOISearch in Google Scholar
  3. Biskup, D. (1999). Single-machine scheduling with learning considerations,(1): 173-178.
    Open DOISearch in Google Scholar
  4. Chen, P., Wu, C.-C. and Lee, W.-C. (2006). A bi-criteria two-machine flowshop scheduling problem with a learning effect,(9): 1113-1125.
    Open DOISearch in Google Scholar
  5. Cheng, T., Yang, S.-J. and Yang, D.-L. (2010).
    Search in Google Scholar
  6. Common due-window assignment and scheduling of linear time-dependent deteriorating jobs and a deteriorating maintenance activity,(1): 154-161, DOI.10.1016/j.ijpe.2010.10.005.
    Open DOISearch in Google Scholar
  7. Dondeti, V.R. and Mohanty, B.B. (1998). Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs,(3): 509-524.
    Open DOISearch in Google Scholar
  8. Garey, M. and Johnson, D. (1978). Strong NP-completness results:Motivation, examples, and implications,(3): 499-508.
    Open DOISearch in Google Scholar
  9. Gáspár, P., Szabó, Z and Bokor, J. (2012). LPV design of fault-tolerant control for road vehicles,(1): 173-182, DOI: 10.2478/v10006-012-0013-x.
    Open DOISearch in Google Scholar
  10. Gordon, V., Proth, J.-M. and Chu, C. (2002). A survey of the state-of-the-art of common due date assignment and scheduling research,(1): 1-25.
    Open DOISearch in Google Scholar
  11. Graham, R.L., Lawler, E.L., Lenstra, J.K. and Kan, A.H.G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey,P.L. Hammer, E.L.
    Open DOISearch in Google Scholar
  12. Johnson and B.H. Korte (Eds.),, Vol. 5, Elsevier, Amsterdam, pp. 287-326.
    Search in Google Scholar
  13. Gunn, T. (1992). Logistics planning,(1): 16-28.
    Search in Google Scholar
  14. Hall, N. and Posner, M. (1991). Earliness-tardiness scheduling problems. I:Weighted deviation of completion times about a common due date,(5): 836-846.
    Search in Google Scholar
  15. Janiak, A., Janiak, W. and Marek, M. (2009). Single processor scheduling problems with various models of a due window assignment,(1): 95-101.
    Open DOISearch in Google Scholar
  16. Janiak, A., Kovalyov, M. and Marek, M. (2007). Soft due window assignment and scheduling on parallel machines,(5): 614-620.
    Open DOISearch in Google Scholar
  17. Janiak, A., Krysiak, T. and Trela, R. (2011). Scheduling problems with learning and aging effects: A survey,(1-2): 19-36.
    Open DOISearch in Google Scholar
  18. Janiak, A. and Marek, M. (2003). Scheduling problems with optimal due interval assignment subject to some generalized criteria,U. Leopold-Wildburger, F. Rendl and G. Wäscher (Eds.),, Springer-Verlag, Berlin/Heidelberg, pp. 217-222.
    Open DOISearch in Google Scholar
  19. Janiak, A. and Marek, M. (2004). Property of symmetry for some single processor scheduling problems with due interval assignment,(2): 97-107.
    Search in Google Scholar
  20. Janiak, A. and Winczaszek, M. (2003). An optimal algorithm for a single processor scheduling problem with a common due window,pp. 1213-1216 .
    Search in Google Scholar
  21. Janiak, A. and Winczaszek, M. (2004). Scheduling problem with nonlinear earliness-tardiness penalty functions,Z. Bubnicki, O. Hryniewicz and J. Weglarz (Eds.),, Academic Publishing House EXIT, Warsaw, pp. 261-270, (in Polish).
    Search in Google Scholar
  22. Janiak, A. and Winczaszek, M. (2005a). Optimal algorithm for parallel processor scheduling problem with due window assignment,pp. 1085-1089.
    Search in Google Scholar
  23. Janiak, A. and Winczaszek, M. (2005b). A single processor scheduling problem with a common due window assignment,H. Fleuren, D. den Hertog and P. Kort (Eds.),, Springer-Verlag, Berlin, pp. 213-220.
    Open DOISearch in Google Scholar
  24. Janiak, A. and Winczaszek, M. (2006). Common due window assignment in parallel processor scheduling problem with nonlinear penalty functions,R. Wyrzykowski, I.
    Open DOISearch in Google Scholar
  25. Dongarra, N. Meyer and J. Waśniewski (Eds.),, Springer-Verlag, Berlin, pp. 132-139.
    Search in Google Scholar
  26. Kołodziej, J. and Xhafa, F. (2011). Modern approaches to modeling user requirements on resource and task allocation in hierarchical computational grids,(2): 243-257, DOI: 10.2478/v10006-011-0018-x.
    Open DOISearch in Google Scholar
  27. Koulamas, C. (1996). Single-machine scheduling with time windows and earliness/tardiness penalties,(1): 190-202.
    Open DOISearch in Google Scholar
  28. Kramer, F.-J. and Lee, C.-Y. (1993). Common due-window scheduling,(4): 262-275.
    Open DOISearch in Google Scholar
  29. Lauff, V. and Werner, F. (2004). Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey,(5-6): 637-655.
    Open DOISearch in Google Scholar
  30. Lee, C. (1991). Earliness-tardiness scheduling problems with constant size of due date window,Vol. 4, Industrial and Systems Engineering Department, University of Florida, Gainesville, FL, pp. 262-275.
    Search in Google Scholar
  31. Liman, S.D., Panwalkar, S.S. and Thongmee, S. (1997). A single machine scheduling problem with common due window and controllable processing times,: 145-154.
    Open DOISearch in Google Scholar
  32. Liman, S.D., Panwalkar, S.S. and Thongmee, S. (1998). Common due window size and location determination in a single machine scheduling problem,(9): 1007-1010.
    Open DOISearch in Google Scholar
  33. Limana, S. and Ramaswamy, S. (1994). Earliness-tardiness scheduling problems with a common delivery window,(4): 195-203.
    Open DOISearch in Google Scholar
  34. Meilijson, I. and Tamir, A. (1984). Minimizing flow time on parallel identical processors with variable unit processing time,(2): 440-448.
    Open DOISearch in Google Scholar
  35. Mosheiov, G. (2001). A due-window determination in minmax scheduling problems,(1): 107-123.
    Open DOISearch in Google Scholar
  36. Mosheiov, G. and Oron, D. (2004). Due-window assignment with unit processing-time jobs,(7): 1005-1017.
    Open DOISearch in Google Scholar
  37. Mosheiov, G. and Sarig, A. (2008). A due-window assignment problem with position-dependent processing times,(7): 997-1003.
    Open DOISearch in Google Scholar
  38. Mosheiov, G. and Sarig, A. (2009a). Minmax scheduling problems with a common due-window,(6): 1886-1892.
    Open DOISearch in Google Scholar
  39. Mosheiov, G. and Sarig, A. (2009b). Scheduling a maintenance activity and due-window assignment on a single machine,(9): 2541-2545.
    Open DOISearch in Google Scholar
  40. Mosheiov, G. and Sarig, A. (2010). Scheduling with a common due-window: Polynomially solvable cases,(8): 1492-1505.
    Open DOISearch in Google Scholar
  41. Mosheiov, G. and Sarig, A. (2011). A note: A due-window assignment problem on parallel identical machines,(1): 238-241.
    Open DOISearch in Google Scholar
  42. Wang, J-B., and Xia, Z.-Q. (2005). Flow-shop scheduling with a learning effect,(11): 1325-1330.
    Open DOISearch in Google Scholar
  43. Wang, J.-B. (2006). A note on scheduling problems with learning effect and deteriorating jobs,(12): 827-833.
    Open DOISearch in Google Scholar
  44. Wang, J.-B. and Wang, C. (2011). Single-machine due-window assignment problem with learning effect and deteriorating jobs,(8): 4017-4022.
    Open DOISearch in Google Scholar
  45. Weng, M. and Ventura, J. (1996). A note on common due window scheduling,(2): 194-200.
    Open DOISearch in Google Scholar
  46. Winczaszek,M. (2006)., Ph.D. thesis, Wrocław University of Technology, Wrocław, (in Polish).
    Search in Google Scholar
  47. Wright, T.P. (1936). Factors affecting the cost of airplanes,(2): 122-128.
    Open DOISearch in Google Scholar
  48. Wu, C.-C. (2005). A makespan study of the two-machine flowshop scheduling problem with a learning effect,(1): 13-25.
    Open DOISearch in Google Scholar
  49. Wu, Y. and Lai, K. (2007). A production scheduling strategy with a common due window,(2): 215-221.
    Open DOISearch in Google Scholar
  50. Wu, Y. and Wang, D. (1999). Optimal single-machine scheduling about a common due window with earliness/tardiness and additional penalties,(12): 1279-1284.
    Open DOISearch in Google Scholar
  51. Yang, S.-J. (2010). Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration,(7): 3321-3329.
    Open DOISearch in Google Scholar
  52. Yang, S.-J., Yang, D.-L. and Cheng, T. (2010). Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance,(8): 1510-1514.
    Open DOISearch in Google Scholar
  53. Yeung, W., Oguz, C. and Cheng, T. (2001a). Minimizing weighted number of early and tardy jobs with a common due window involving location penalty,(1-4): 33-54.
    Search in Google Scholar
  54. Yeung, W., Oguz, C. and Cheng, T. (2001b). Single-machine scheduling with a common due window,(2): 157-175.
    Open DOISearch in Google Scholar
  55. Zhao, C. and Tang, H. (2010). A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity,(6): 1300-1303, DOI:10.1016/j.cor.2010.04.006.
    Open DOISearch in Google Scholar
DOI: https://doi.org/10.2478/amcs-2013-0018 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Journal RSS Feed
Language: English
Page range: 231 - 241
Published on: Mar 26, 2013
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
scheduling,
due window assignment,
earliness/tardiness,
practical example
Related subjects:
Mathematics,
Applied mathematics

© 2013 Adam Janiak, Tomasz Kwiatkowski, Maciej Lichtenstein, published by University of Zielona Góra
This work is licensed under the Creative Commons License.

Volume 23 (2013): Issue 1 (March 2013)
Previous article