Scheduling problems with a common due window assignment: A survey

Azizoglu, M. and Webster, S. (1997). Scheduling about an unrestricted common due window with arbitrary earliness/tardiness penalty rates, IIE Transactions29(11): 1001-1006.10.1080/07408179708966418Search in Google Scholar

Baker, K.R. and Scudder, G.D. (1990). Sequencing with earliness and tardiness penalties: A review, Operations Research38(1): 22-36.10.1287/opre.38.1.22Search in Google Scholar

Biskup, D. (1999). Single-machine scheduling with learning considerations, European Journal of Operational Research115(1): 173-178.10.1016/S0377-2217(98)00246-XSearch in Google Scholar

Chen, P., Wu, C.-C. and Lee, W.-C. (2006). A bi-criteria two-machine flowshop scheduling problem with a learning effect, Journal of the Operational Research Society57(9): 1113-1125.10.1057/palgrave.jors.2602095Search in Google Scholar

Cheng, T., Yang, S.-J. and Yang, D.-L. (2010).Search in Google Scholar

Common due-window assignment and scheduling of linear time-dependent deteriorating jobs and a deteriorating maintenance activity, International Journalof Production Economics 135(1): 154-161, DOI.10.1016/j.ijpe.2010.10.005.10.1016/j.ijpe.2010.10.005Search in Google Scholar

Dondeti, V.R. and Mohanty, B.B. (1998). Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs, European Journal of Operational Research105(3): 509-524.10.1016/S0377-2217(97)00070-2Search in Google Scholar

Garey, M. and Johnson, D. (1978). Strong NP-completness results:Motivation, examples, and implications, Journal ofthe ACM 25(3): 499-508.10.1145/322077.322090Search in Google Scholar

Gáspár, P., Szabó, Z and Bokor, J. (2012). LPV design of fault-tolerant control for road vehicles, InternationalJournal of Applied Mathematics and Computer Science22(1): 173-182, DOI: 10.2478/v10006-012-0013-x.10.2478/v10006-012-0013-xSearch in Google Scholar

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, European Journal of Operational Research 139(1): 1-25.10.1016/S0377-2217(01)00181-3Search in Google Scholar

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, in P.L. Hammer, E.L.10.1016/S0167-5060(08)70356-XSearch in Google Scholar

Johnson and B.H. Korte (Eds.), Annals of Discrete Mathematics, Vol. 5, Elsevier, Amsterdam, pp. 287-326.Search in Google Scholar

Gunn, T. (1992). Logistics planning, OR/MS Today19(1): 16-28.Search in Google Scholar

Hall, N. and Posner, M. (1991). Earliness-tardiness scheduling problems. I:Weighted deviation of completion times about a common due date, Operations Research 39(5): 836-846.Search in Google Scholar

Janiak, A., Janiak, W. and Marek, M. (2009). Single processor scheduling problems with various models of a due window assignment, Bulletin of the Polish Academy of Sciences:Technical Sciences 57(1): 95-101.10.2478/v10175-010-0110-7Search in Google Scholar

Janiak, A., Kovalyov, M. and Marek, M. (2007). Soft due window assignment and scheduling on parallel machines, IEEE Transactions on Systems, Man, and Cybernetics, PartA: Systems and Humans 37(5): 614-620.10.1109/TSMCA.2007.893485Search in Google Scholar

Janiak, A., Krysiak, T. and Trela, R. (2011). Scheduling problems with learning and aging effects: A survey, DecisionMaking in Manufacturing and Services 5(1-2): 19-36.10.7494/dmms.2011.5.1.19Search in Google Scholar

Janiak, A. and Marek, M. (2003). Scheduling problems with optimal due interval assignment subject to some generalized criteria, in U. Leopold-Wildburger, F. Rendl and G. Wäscher (Eds.), Operations Research Proceedings2002, Springer-Verlag, Berlin/Heidelberg, pp. 217-222.10.1007/978-3-642-55537-4_35Search in Google Scholar

Janiak, A. and Marek, M. (2004). Property of symmetry for some single processor scheduling problems with due interval assignment, Systems Science 30(2): 97-107.Search in Google Scholar

Janiak, A. and Winczaszek, M. (2003). An optimal algorithm for a single processor scheduling problem with a common due window, Proceedings of the 9th IEEE International Conferenceon Methods and Models in Automation and Robotics(MMAR 2003), Mi˛edzyzdroje, Poland, pp. 1213-1216 .Search in Google Scholar

Janiak, A. and Winczaszek, M. (2004). Scheduling problem with nonlinear earliness-tardiness penalty functions, in Z. Bubnicki, O. Hryniewicz and J. Weglarz (Eds.), Operationand System Research 2004, Academic Publishing House EXIT, Warsaw, pp. 261-270, (in Polish).Search in Google Scholar

Janiak, A. and Winczaszek, M. (2005a). Optimal algorithm for parallel processor scheduling problem with due window assignment, Proceedings of the 11th IEEE InternationalConference on Methods and Models in Automation and Robotics,Mi˛edzyzdroje, Poland, pp. 1085-1089.Search in Google Scholar

Janiak, A. and Winczaszek, M. (2005b). A single processor scheduling problem with a common due window assignment, in H. Fleuren, D. den Hertog and P. Kort (Eds.), Operations Research, Springer-Verlag, Berlin, pp. 213-220.10.1007/3-540-27679-3_27Search in Google Scholar

Janiak, A. and Winczaszek, M. (2006). Common due window assignment in parallel processor scheduling problem with nonlinear penalty functions, in R. Wyrzykowski, I.10.1007/11752578_17Search in Google Scholar

Dongarra, N. Meyer and J. Waśniewski (Eds.), ParallelProcessing and Applied Mathematics, Springer-Verlag, Berlin, pp. 132-139.Search in Google Scholar

Kołodziej, J. and Xhafa, F. (2011). Modern approaches to modeling user requirements on resource and task allocation in hierarchical computational grids, InternationalJournal of Applied Mathematics and Computer Science21(2): 243-257, DOI: 10.2478/v10006-011-0018-x.10.2478/v10006-011-0018-xSearch in Google Scholar

Koulamas, C. (1996). Single-machine scheduling with time windows and earliness/tardiness penalties, European Journalof Operational Research 91(1): 190-202.10.1016/0377-2217(95)00116-6Search in Google Scholar

Kramer, F.-J. and Lee, C.-Y. (1993). Common due-window scheduling, Production and Operations Management2(4): 262-275.10.1111/j.1937-5956.1993.tb00102.xSearch in Google Scholar

Lauff, V. and Werner, F. (2004). Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey, Mathematical and Computer Modelling40(5-6): 637-655.10.1016/j.mcm.2003.05.019Search in Google Scholar

Lee, C. (1991). Earliness-tardiness scheduling problems with constant size of due date window, Research ReportNo. 91-17, Vol. 4, Industrial and Systems Engineering Department, University of Florida, Gainesville, FL, pp. 262-275.Search in Google Scholar

Liman, S.D., Panwalkar, S.S. and Thongmee, S. (1997). A single machine scheduling problem with common due window and controllable processing times, Annals of OperationsResearch 70: 145-154.10.1023/A:1018965919691Search in Google Scholar

Liman, S.D., Panwalkar, S.S. and Thongmee, S. (1998). Common due window size and location determination in a single machine scheduling problem, Journal of the OperationalResearch Society 49(9): 1007-1010.10.1038/sj.jors.2600601Search in Google Scholar

Limana, S. and Ramaswamy, S. (1994). Earliness-tardiness scheduling problems with a common delivery window, Operations Research Letters 15(4): 195-203.10.1016/0167-6377(94)90078-7Search in Google Scholar

Meilijson, I. and Tamir, A. (1984). Minimizing flow time on parallel identical processors with variable unit processing time, Operations Research 32(2): 440-448.10.1287/opre.32.2.440Search in Google Scholar

Mosheiov, G. (2001). A due-window determination in minmax scheduling problems, INFOR 39(1): 107-123.10.1080/03155986.2001.11732429Search in Google Scholar

Mosheiov, G. and Oron, D. (2004). Due-window assignment with unit processing-time jobs, Naval Research Logistics51(7): 1005-1017.10.1002/nav.20039Search in Google Scholar

Mosheiov, G. and Sarig, A. (2008). A due-window assignment problem with position-dependent processing times, Journalof the Operational Research Society 59(7): 997-1003.10.1057/palgrave.jors.2602439Search in Google Scholar

Mosheiov, G. and Sarig, A. (2009a). Minmax scheduling problems with a common due-window, Computers & OperationsResearch 36(6): 1886-1892.10.1016/j.cor.2008.06.001Search in Google Scholar

Mosheiov, G. and Sarig, A. (2009b). Scheduling a maintenance activity and due-window assignment on a single machine, Computers & Operations Research 36(9): 2541-2545.10.1016/j.cor.2008.10.007Search in Google Scholar

Mosheiov, G. and Sarig, A. (2010). Scheduling with a common due-window: Polynomially solvable cases, InformationSciences 180(8): 1492-1505.10.1016/j.ins.2009.11.042Search in Google Scholar

Mosheiov, G. and Sarig, A. (2011). A note: A due-window assignment problem on parallel identical machines, Journalof the Operational Research Society 62(1): 238-241.10.1057/jors.2009.179Search in Google Scholar

Wang, J-B., and Xia, Z.-Q. (2005). Flow-shop scheduling with a learning effect, Journal of the Operational Research Society56(11): 1325-1330.10.1057/palgrave.jors.2601856Search in Google Scholar

Wang, J.-B. (2006). A note on scheduling problems with learning effect and deteriorating jobs, International Journalof Systems Science 37(12): 827-833.10.1080/00207720600879260Search in Google Scholar

Wang, J.-B. and Wang, C. (2011). Single-machine due-window assignment problem with learning effect and deteriorating jobs, Applied Mathematical Modelling 35(8): 4017-4022.10.1016/j.apm.2011.02.023Search in Google Scholar

Weng, M. and Ventura, J. (1996). A note on common due window scheduling, Production and Operations Management5(2): 194-200.10.1111/j.1937-5956.1996.tb00393.xSearch in Google Scholar

Winczaszek,M. (2006). Selected Scheduling Problems with DueWindow Assignment, Ph.D. thesis, Wrocław University of Technology, Wrocław, (in Polish).Search in Google Scholar

Wright, T.P. (1936). Factors affecting the cost of airplanes, Journalof Aeronautical Science 3(2): 122-128.10.2514/8.155Search in Google Scholar

Wu, C.-C. (2005). A makespan study of the two-machine flowshop scheduling problem with a learning effect, Journalof Statistics and Management Systems 8(1): 13-25.10.1080/09720510.2005.10701143Search in Google Scholar

Wu, Y. and Lai, K. (2007). A production scheduling strategy with a common due window, Computers & Industrial Engineering53(2): 215-221.10.1016/j.cie.2007.06.012Search in Google Scholar

Wu, Y. and Wang, D. (1999). Optimal single-machine scheduling about a common due window with earliness/tardiness and additional penalties, InternationalJournal of Systems Sciences 30(12): 1279-1284.10.1080/002077299291570Search in Google Scholar

Yang, S.-J. (2010). Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration, Applied Mathematics and Computation217(7): 3321-3329.10.1016/j.amc.2010.08.064Search in Google Scholar

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, Computers & Operations Research37(8): 1510-1514.10.1016/j.cor.2009.11.007Search in Google Scholar

Yeung, W., Oguz, C. and Cheng, T. (2001a). Minimizing weighted number of early and tardy jobs with a common due window involving location penalty, Annals of OperationsResearch 108(1-4): 33-54.Search in Google Scholar

Yeung, W., Oguz, C. and Cheng, T. (2001b). Single-machine scheduling with a common due window, Computers &Operations Research 28(2): 157-175.10.1016/S0305-0548(99)00097-0Search in Google Scholar

Zhao, C. and Tang, H. (2010). A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity, Computers & Operations Research39(6): 1300-1303, DOI:10.1016/j.cor.2010.04.006.10.1016/j.cor.2010.04.006Search in Google Scholar