### Szczegóły

#### Tytuł artykułu

Single processor scheduling problems with various models of a due window assignment#### Tytuł czasopisma

Bulletin of the Polish Academy of Sciences: Technical Sciences#### Rocznik

2009#### Wolumin

vol. 57#### Numer

No 1#### Autorzy

#### Wydział PAN

Nauki Techniczne#### Zakres

95-101#### Wydawca

Polish Academy of Sciences#### Data

2009#### Identyfikator

ISSN 0239-7528, eISSN 2300-1917#### Referencje

Sterna M. (2007), Dominance relations for two-machine flow shop problem with late work criterion, Bull. Pol. Ac.: Tech, 55, 1, 59. ; Cheng T. (1989), Survey of scheduling research involving due date determination decision, Eur. J. Operational Research, 38, 156. ; Chengbin C. (2002), A survey of the state-of-the-art of common due date assignment and scheduling research, Eur. J. Operational Research, 139, 1. ; Chengbin C. (2002), Due date assignment and scheduling: SLK, TWK and other due date assignment models, Production Planning & Control, 13, 2, 117. ; Federgruen A. (1993), Simultaneous optimization of efficiency and performance balance measures in single-machine scheduling problems, Naval Research Logistics, 40, 952. ; Federgruen A. (1994), Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs, Operations Research Letters, 16, 199. ; Cai X. (1997), Scheduling about a common due date with job-dependent asymmetric earliness and tardiness penalties, Eur. J. Operational Research, 98, 154. ; F. D. Anger, C.-Y. Lee and Martin-Vega L. A., "Single-machine", <i>Research Report</i> pp. 86-16, Department of Industrial and System Engineering, University of Florida, Florida, 1986. ; Cheng T. (1988), Optimal common due-date with limited completion times deviation, Computers and Operations Research, 15, 91. ; C.-Y. Lee, "Earliness-tardiness scheduling problems with constant size of due window", <i>Research Report</i> pp. 91-17, Department of Industrial and System Engineering, University of Florida, Florida, 1991. ; Kramer F.-J. (1993), Common due-window scheduling, Production and Operations Management, 2, 262. ; Ventura J. (1995), Single machine scheduling with a common delivery window, J. Operational Research Society, 47, 424. ; Weng M. (1994), Scheduling about a large common due-date with tolerance to minimize mean absolute deviation of completion times, Naval Research Logistics, 41, 843. ; Weng M. (1996), Single-machine earliness-tardiness scheduling about a common due date with tolerances, Int. J. Production Economics, 42, 217. ; Liman S. (1994), Earliness-tardiness scheduling problems with a common delivery window, Operations Research Letters, 15, 195. ; Lann A. (1996), Single-machine scheduling to minimize the number of early and terdy jobs, Computers and Operations Research, 23, 769. ; Lann A. (2003), A note on the maximum number of on-time jobs on parallel identical processors, Computers & Operations Research, 30, 1745. ; Koulamas C. (1996), Single-machine scheduling with time windows and earliness/tardiness penalties, Eur. J. Operational Research, 91, 190. ; Azizoglu M. (1997), Scheduling about an unrestricted common due window with arbitrary earliness/tardiness penalty rates, IIE Transactions, 29, 1001. ; Wu Y. (1999), Optimal single-machine scheduling about a common due window with earliness/tardiness and additional penalties, Int. J. Systems Science, 30, 1279. ; Linn R. (2000), Just-in-time scheduling with machining economics for single-machine turning process, J. Manufacturing Systems, 19, 219. ; Yeung W. (2001), Minimizing weighted number of early and tardy jobs with a common due window involving location penalty, Annals of Operations Research, 108, 33. ; Yoo W. (2001), Scheduling single-machine problems for on-time delivery, Computers and Industrial Engineering, 39, 371. ; Chen Z.-L. (2002), Parallel machine scheduling with a common due window, Eur. J. Operational Research, 136, 512. ; Biskup D. (2005), On scheduling around large restrictive common due windows, Eur. J. Operational Research, 162, 740. ; Wodecki M. (null), A block approach to earliness-tardiness scheduling problems, Int. J. Advanced Manufacturing Technology. ; Janiak A. (2000), Single machine scheduling problem with optimal due interval assignment, Lecture Notes of Silesia University of Technology, Automation, 129, 145. ; Janiak A. (2002), Multi-machine scheduling problem with optimal due interval assignment subject to generalized sum type criterion, Operations Research Proc, 207. ; Kramer F.-J. (1994), Due window scheduling for parallel machine, Mathematical and Computer Modeling, 20, 69. ; Liman S. (1996), Determination of common due window location in a single machine scheduling problem, Eur. J. Operational Research, 93, 68. ; Liman S. (1998), Common due window size and location determination in a single machine scheduling problem, J. Operational Research Society, 49, 1007. ; Mosheiov G. (null), A multi-criteria scheduling with due-window assignment problem, Mathematical and Computer Modelling. ; Yeung W. (2001), Single-machine scheduling with a common due window, Computers and Operations Research, 28, 157. ; Mosheiov G. (2001), A due-window determination in minmax scheduling problems, INFOR, 39, 107. ; Janiak A. (2001), Optimal assignment of due intervals in some single machine scheduling problems, Lecture Notes of Mining and Metallurgical Academy, Automation, 5, 1-2, 269. ; Janiak A. (2003), Scheduling problems with optimal due interval assignment subject to some generalized criteria, Operations Research Proc, 142. ; Graham R. (1979), Optimization and approximation in deterministic sequencing and scheduling: a survey, Ann. Discrete Math, 5, 287. ; Kahlbacher H. (1993), Scheduling with monotonous earliness and tardiness penalties, Eur. J. Operational Research, 64, 258.#### DOI

10.2478/v10175-010-0110-7