-
1
-
-
0029736136
-
Single machine batch scheduling to minimize the weighted number of late jobs
-
Brucker, P., & Kovalyov, M. Y. (1996). Single machine batch scheduling to minimize the weighted number of late jobs. Mathematical Methods of Operations Research, 43, 1-8.
-
(1996)
Mathematical Methods of Operations Research
, vol.43
, pp. 1-8
-
-
Brucker, P.1
Kovalyov, M.Y.2
-
2
-
-
0008346991
-
Batch scheduling and common due-date assignment on a single machine
-
Cheng, T. C. E., & Kovalyov, M. Y. (1996). Batch scheduling and common due-date assignment on a single machine. Discrete Applied Mathematics, 70(3), 231-245.
-
(1996)
Discrete Applied Mathematics
, vol.70
, Issue.3
, pp. 231-245
-
-
Cheng, T.C.E.1
Kovalyov, M.Y.2
-
3
-
-
33644527582
-
An FPTAS for a single-item capacity economic lot-sizing problem with monotone cost structure
-
Chubanov, S., Kovalyov, M., & Pesch, E. (2006). An FPTAS for a single-item capacity economic lot-sizing problem with monotone cost structure. Mathematical Programming Series A, 106, 453-466.
-
(2006)
Mathematical Programming Series A
, vol.106
, pp. 453-466
-
-
Chubanov, S.1
Kovalyov, M.2
Pesch, E.3
-
4
-
-
0003811665
-
Discrete optimization problems and efficient approximate algorithms
-
Gens, G. V., & Levner, E. V. (1979). Discrete optimization problems and efficient approximate algorithms. Engineering Cybernetics, 17(6), 1-11.
-
(1979)
Engineering Cybernetics
, vol.17
, Issue.6
, pp. 1-11
-
-
Gens, G.V.1
Levner, E.V.2
-
5
-
-
0019633768
-
Fast approximation algorithm for job sequencing with deadlines
-
Gens, G. V., & Levner, E. V. (1981). Fast approximation algorithm for job sequencing with deadlines. Discrete Applied Mathematics, 3(4), 313-318.
-
(1981)
Discrete Applied Mathematics
, vol.3
, Issue.4
, pp. 313-318
-
-
Gens, G.V.1
Levner, E.V.2
-
6
-
-
0037118177
-
A survey of the state-of-the-art of common due date assignment and scheduling research
-
Gordon, V. S., Proth, J.-M., & 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(3), 1-25.
-
(2002)
European Journal of Operational Research
, vol.139
, Issue.3
, pp. 1-25
-
-
Gordon, V.S.1
Proth, J.-M.2
Chu, C.3
-
7
-
-
84979033734
-
Scheduling with due date assignment
-
J. Y.-T. Leung (Ed.)
-
Gordon, V. S., Proth, J.-M., & Strusevich, V. A. (2004). Scheduling with due date assignment. In J. Y.-T. Leung (Ed.), Handbook of scheduling: algorithms, models and performance analysis (Vol. 21, pp. 1-22).
-
(2004)
Handbook of Scheduling: Algorithms, Models and Performance Analysis
, vol.21
, pp. 1-22
-
-
Gordon, V.S.1
Proth, J.-M.2
Strusevich, V.A.3
-
8
-
-
74849101820
-
Optimization and approximation in deterministic sequencing and scheduling: a survey
-
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 4, 287-326.
-
(1979)
Annals of Discrete Mathematics
, vol.4
, pp. 287-326
-
-
Graham, R.L.1
Lawler, E.L.2
Lenstra, J.K.3
Rinnooy Kan, A.H.G.4
-
9
-
-
2342539189
-
Supply chain scheduling: batching and delivery
-
Hall, N. G., & Potts, C. N. (2003). Supply chain scheduling: batching and delivery. Operations Research, 51(4), 566-584.
-
(2003)
Operations Research
, vol.51
, Issue.4
, pp. 566-584
-
-
Hall, N.G.1
Potts, C.N.2
-
10
-
-
24144473403
-
The coordination of scheduling and batch deliveries
-
Hall, N. G., & Potts, C. N. (2005). The coordination of scheduling and batch deliveries. Annals of Operations Research, 135(1), 41-64.
-
(2005)
Annals of Operations Research
, vol.135
, Issue.1
, pp. 41-64
-
-
Hall, N.G.1
Potts, C.N.2
-
11
-
-
44449101180
-
A single processor scheduling problem with a common due window assignment
-
D. HertogDen, H. Fleuren, and P. Kort (Eds.), Berlin: Springer
-
Janiak, A., & Winczaszek, M. (2004). A single processor scheduling problem with a common due window assignment. In D. Den Hertog, H. Fleuren, & P. Kort (Eds.), Operations research 2004 (pp. 213-220). Berlin: Springer.
-
(2004)
Operations Research 2004
, pp. 213-220
-
-
Janiak, A.1
Winczaszek, M.2
-
12
-
-
34548272651
-
Soft due window assignment and scheduling on parallel machines
-
Janiak, A., Kovalyov, M. Y., & Marek, M. (2007). Soft due window assignment and scheduling on parallel machines. IEEE Trans. on Systems, Man and Cybernetics, Part A, 37, 614-620.
-
(2007)
IEEE Trans. On Systems, Man and Cybernetics, Part A
, vol.37
, pp. 614-620
-
-
Janiak, A.1
Kovalyov, M.Y.2
Marek, M.3
-
13
-
-
85034239852
-
Due date quotation models and algorithms
-
J. Y.-T. Leung (Ed.)
-
Kaminsky, P., & Hochbaum, D. S. (2004). Due date quotation models and algorithms. In J. Y.-T. Leung (Ed.), Handbook of scheduling: algorithms, models and performance analysis (Vol. 20, pp. 1-22).
-
(2004)
Handbook of Scheduling: Algorithms, Models and Performance Analysis
, vol.20
, pp. 1-22
-
-
Kaminsky, P.1
Hochbaum, D.S.2
-
14
-
-
0003037529
-
Reducibility among combinatorial problems
-
R. E. Miller and J. W. Thatcher (Eds.)
-
Karp, R. M. (1972). Reducibility among combinatorial problems. In R. E. Miller & J. W. Thatcher (Eds.), Complexity of computer computations (pp. 85-103).
-
(1972)
Complexity of Computer Computations
, pp. 85-103
-
-
Karp, R.M.1
-
15
-
-
0007603085
-
Improving the complexities of approximation algorithms for optimization problems
-
Kovalyov, M. Y. (1995). Improving the complexities of approximation algorithms for optimization problems. Operations Research Letters, 17, 85-87.
-
(1995)
Operations Research Letters
, vol.17
, pp. 85-87
-
-
Kovalyov, M.Y.1
-
16
-
-
77649306890
-
Optimal delivery time quotation to minimize total tardiness penalties with controllable processing times
-
Leyvand, Y., Shabtay, D., & Steiner, G. (2010). Optimal delivery time quotation to minimize total tardiness penalties with controllable processing times. IIE Transactions, 42(3), 221-231.
-
(2010)
IIE Transactions
, vol.42
, Issue.3
, pp. 221-231
-
-
Leyvand, Y.1
Shabtay, D.2
Steiner, G.3
-
17
-
-
0000062028
-
An n job, one machine sequencing algorithm for minimzing the number of late jobs
-
Moore, J. M. (1968). An n job, one machine sequencing algorithm for minimzing the number of late jobs. Management Science, 15, 102-109.
-
(1968)
Management Science
, vol.15
, pp. 102-109
-
-
Moore, J.M.1
-
19
-
-
0016883405
-
Algorithms for scheduling independent tasks
-
Sahni, S. K. (1976). Algorithms for scheduling independent tasks. Journal of the ACM, 23(1), 116-127.
-
(1976)
Journal of the ACM
, vol.23
, Issue.1
, pp. 116-127
-
-
Sahni, S.K.1
-
20
-
-
38749154324
-
The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
-
Shabtay, D., & Steiner, G. (2008). The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times. Annals of Operations Research, 159(1), 25-40.
-
(2008)
Annals of Operations Research
, vol.159
, Issue.1
, pp. 25-40
-
-
Shabtay, D.1
Steiner, G.2
-
21
-
-
10444270224
-
Manufacturing lead-time rules: Customer retention versus tardiness costs
-
Slotnick, S. A., & Sobel, M. J. (2005). Manufacturing lead-time rules: Customer retention versus tardiness costs. European Journal of Operational Research, 169, 825-856.
-
(2005)
European Journal of Operational Research
, vol.169
, pp. 825-856
-
-
Slotnick, S.A.1
Sobel, M.J.2
-
23
-
-
72249103636
-
Minimizing the weighted number of late jobs with batch setup times and delivery costs on a single machine
-
E. V. Levner (Ed.)
-
Steiner, G., & Zhang, R. (2007b). Minimizing the weighted number of late jobs with batch setup times and delivery costs on a single machine. In E. V. Levner (Ed.), Multiprocessor scheduling, theory and applications (pp. 85-98).
-
(2007)
Multiprocessor Scheduling, Theory and Applications
, pp. 85-98
-
-
Steiner, G.1
Zhang, R.2
-
24
-
-
72249114482
-
Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains
-
Steiner, G., & Zhang, R. (2009). Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains. Journal of Scheduling, 12(6), 565-574.
-
(2009)
Journal of Scheduling
, vol.12
, Issue.6
, pp. 565-574
-
-
Steiner, G.1
Zhang, R.2
|