-
1
-
-
0023977010
-
The shifting bottleneck procedure for job shop scheduling
-
Adams J, Balas E and Zawack D (1988). The shifting bottleneck procedure for job shop scheduling. Mngt Sci 34: 391-401.
-
(1988)
Mngt Sci
, vol.34
, pp. 391-401
-
-
Adams, J.1
Balas, E.2
Zawack, D.3
-
2
-
-
0032606578
-
Approximation schemes for minimizing average weighted completion time with release dates
-
IEEE Computer Society Press: Los Alamitos, CA, pp
-
Afrati. F, Bampis E, Chekuri C, Karger D, Kenyon C, Khanna S, Mills I, Queyranne M, Skutella M, Stein C and Sviridenko M (1999). Approximation schemes for minimizing average weighted completion time with release dates. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press: Los Alamitos, CA, pp 32-43.
-
(1999)
Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science
, pp. 32-43
-
-
Afrati, F.1
Bampis, E.2
Chekuri, C.3
Karger, D.4
Kenyon, C.5
Khanna, S.6
Mills, I.7
Queyranne, M.8
Skutella, M.9
Stein, C.10
Sviridenko, M.11
-
3
-
-
84867980790
-
A survey of very large-scale neighborhood search techniques
-
Ahuja RK, Ergun Ö, Orlin JB and Punnen AP (2002). A survey of very large-scale neighborhood search techniques. Disc Appl Math 123: 75-102.
-
(2002)
Disc Appl Math
, vol.123
, pp. 75-102
-
-
Ahuja, R.K.1
Ergun, O.2
Orlin, J.B.3
Punnen, A.P.4
-
4
-
-
0001178278
-
A non-numerical approach, to production scheduling problems
-
Akers Jr SB and Friedman J (1955). A non-numerical approach, to production scheduling problems. Opns Res 3: 429-442.
-
(1955)
Opns Res
, vol.3
, pp. 429-442
-
-
Akers Jr, S.B.1
Friedman, J.2
-
5
-
-
0009645458
-
A polynomial-time algorithm for an approximate solution of a scheduling problem
-
in Russian
-
Aksjonov VA (1988). A polynomial-time algorithm for an approximate solution of a scheduling problem. Upravlyaemye Sistemy 28: 8-11 (in Russian).
-
(1988)
Upravlyaemye Sistemy
, vol.28
, pp. 8-11
-
-
Aksjonov, V.A.1
-
6
-
-
5544297208
-
Online scheduling of a single machine to minimize total weighted completion time
-
Anderson EJ and Potts CN (2004). Online scheduling of a single machine to minimize total weighted completion time. Math Opns Res 29: 686-697.
-
(2004)
Math Opns Res
, vol.29
, pp. 686-697
-
-
Anderson, E.J.1
Potts, C.N.2
-
7
-
-
34247502124
-
Hybrid metaheuristics to aid runway scheduling at London Heathrow airport
-
Atkin JAD, Burke EK, Greenwood JS and Reeson D (2007). Hybrid metaheuristics to aid runway scheduling at London Heathrow airport. Trans Sci 41: 90-106.
-
(2007)
Trans Sci
, vol.41
, pp. 90-106
-
-
Atkin, J.A.D.1
Burke, E.K.2
Greenwood, J.S.3
Reeson, D.4
-
9
-
-
0025211593
-
Sequencing with earliness and tardiness penalties: A review
-
Baker KR and Scudder GD (1990). Sequencing with earliness and tardiness penalties: A review. Opns Res 38: 22-36.
-
(1990)
Opns Res
, vol.38
, pp. 22-36
-
-
Baker, K.R.1
Scudder, G.D.2
-
10
-
-
0031997369
-
Guided local search with shifting bottleneck, for job shop scheduling
-
Balas E and Vazacopoulos A (1998). Guided local search with shifting bottleneck, for job shop scheduling. Mngt Sci 44: 262-275.
-
(1998)
Mngt Sci
, vol.44
, pp. 262-275
-
-
Balas, E.1
Vazacopoulos, A.2
-
11
-
-
0010918986
-
-
1.982, Nearly optimum solution of multimachine scheduling problems, in Hungarian
-
Bárány I and Fiala T (1.982). Nearly optimum solution of multimachine scheduling problems. Szigma 15: 177-191 (in Hungarian).
-
Szigma
, vol.15
, pp. 177-191
-
-
Bárány, I.1
Fiala, T.2
-
12
-
-
0029288391
-
Solving the job shop scheduling problem with tabu search
-
Barnes JW and Chambers JB (1993). Solving the job shop scheduling problem with tabu search. HE Trans 27: 257-263.
-
(1993)
HE Trans
, vol.27
, pp. 257-263
-
-
Barnes, J.W.1
Chambers, J.B.2
-
13
-
-
0035342738
-
Scheduling aircraft landings at London Heathrow using a population heuristic
-
Beasley JE, Sonander J and Havelock P (2001). Scheduling aircraft landings at London Heathrow using a population heuristic. J Opl Res Soc 52: 483-493.
-
(2001)
J Opl Res Soc
, vol.52
, pp. 483-493
-
-
Beasley, J.E.1
Sonander, J.2
Havelock, P.3
-
14
-
-
39049092042
-
An improved approximation algorithm for the two-machine open shop scheduling problem with family setup times
-
Billaut J-C, Gribkovskaia IV and Strusevich VA (2008). An improved approximation algorithm for the two-machine open shop scheduling problem with family setup times. HE Trans 40: 478-493.
-
(2008)
HE Trans
, vol.40
, pp. 478-493
-
-
Billaut, J.-C.1
Gribkovskaia, I.V.2
Strusevich, V.A.3
-
16
-
-
0000692965
-
A new adaptive multistart technique for combinatorial global optimizations
-
Boese KD, Kahng AB and Muddu S (1994). A new adaptive multistart technique for combinatorial global optimizations. Opns Res Lett 16: 101-113.
-
(1994)
Opns Res Lett
, vol.16
, pp. 101-113
-
-
Boese, K.D.1
Kahng, A.B.2
Muddu, S.3
-
17
-
-
64749086044
-
-
max) problem. Nav Res Logist Quart 20: 57-67.
-
max) problem. Nav Res Logist Quart 20: 57-67.
-
-
-
-
18
-
-
0011725015
-
An algorithm for finding optimal or near optimal solutions to the production scheduling problem
-
Brooks GH and White CR (1965). An algorithm for finding optimal or near optimal solutions to the production scheduling problem. J Indust Eng 16: 34-40.
-
(1965)
J Indust Eng
, vol.16
, pp. 34-40
-
-
Brooks, G.H.1
White, C.R.2
-
20
-
-
0042130289
-
Improving local search heuristics for some scheduling problems-I
-
Brucker P, Hurink J and Werner F (1996). Improving local search heuristics for some scheduling problems-I. Disc Appl Math 65: 97-122.
-
(1996)
Disc Appl Math
, vol.65
, pp. 97-122
-
-
Brucker, P.1
Hurink, J.2
Werner, F.3
-
21
-
-
0001114898
-
Improving local search. heuristics for some scheduling problems. Part II
-
Brucker P, Hurink J and Werner F (1997). Improving local search. heuristics for some scheduling problems. Part II. Disc Appl Math 72: 47-69.
-
(1997)
Disc Appl Math
, vol.72
, pp. 47-69
-
-
Brucker, P.1
Hurink, J.2
Werner, F.3
-
22
-
-
0001820814
-
Scheduling a batching machine
-
Brucker P, Gladky A, Hoogeveen JA, Kovalyov MY, Potts CN, Tautenhahn T and Van de Velde SL (1998). Scheduling a batching machine. J Schedul 1: 31-54.
-
(1998)
J Schedul
, vol.1
, pp. 31-54
-
-
Brucker, P.1
Gladky, A.2
Hoogeveen, J.A.3
Kovalyov, M.Y.4
Potts, C.N.5
Tautenhahn, T.6
Van de Velde, S.L.7
-
23
-
-
0000612586
-
Complexity of task sequencing with deadlines, set-up times and changeover costs
-
Bruno JL and Downey PJ (1978). Complexity of task sequencing with deadlines, set-up times and changeover costs. SIAM J Comput 7: 393-404.
-
(1978)
SIAM J Comput
, vol.7
, pp. 393-404
-
-
Bruno, J.L.1
Downey, P.J.2
-
24
-
-
0016080006
-
Scheduling independent tasks to reduce mean finishing time
-
Bruno JL, Coffman Jr EG and Sethi. R (1974). Scheduling independent tasks to reduce mean finishing time. Comm ACM 17: 382-387.
-
(1974)
Comm ACM
, vol.17
, pp. 382-387
-
-
Bruno, J.L.1
Coffman Jr, E.G.2
Sethi, R.3
-
25
-
-
0020178733
-
The one-machine sequencing problem
-
Carlier J (1982). The one-machine sequencing problem. Eur J Opl Res 11: 42-47.
-
(1982)
Eur J Opl Res
, vol.11
, pp. 42-47
-
-
Carlier, J.1
-
26
-
-
0000165767
-
An algorithm for solving the job-shop problem
-
Carlier J and Pinson E (1989). An algorithm for solving the job-shop problem. Mngt Sci 35: 164-176.
-
(1989)
Mngt Sci
, vol.35
, pp. 164-176
-
-
Carlier, J.1
Pinson, E.2
-
27
-
-
0021819411
-
Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
-
Cerny V (1985). Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. J Opti Theory Appl 45:41-51.
-
(1985)
J Opti Theory Appl
, vol.45
, pp. 41-51
-
-
Cerny, V.1
-
28
-
-
0014813441
-
A method of solution for general machine-scheduling problems
-
Charlton JM and Death CC (1970). A method of solution for general machine-scheduling problems. Opns Res 18: 689-707.
-
(1970)
Opns Res
, vol.18
, pp. 689-707
-
-
Charlton, J.M.1
Death, C.C.2
-
29
-
-
0001056109
-
Approximation algorithms for three-machine open shop scheduling
-
Chen B and Strusevich VA (1993). Approximation algorithms for three-machine open shop scheduling. ORSA J Comput 5: 321-326.
-
(1993)
ORSA J Comput
, vol.5
, pp. 321-326
-
-
Chen, B.1
Strusevich, V.A.2
-
31
-
-
0012694908
-
(1.998). Approximation algorithms for two-machine flow shop scheduling with, batch setup times
-
Chen B, Potts CN and Strusevich VA (1.998). Approximation algorithms for two-machine flow shop scheduling with, batch setup times. Math Progr B 82: 255-271.
-
Math Progr B
, vol.82
, pp. 255-271
-
-
Chen, B.1
Potts, C.N.2
Strusevich, V.A.3
-
32
-
-
64749096784
-
Integrated production and outbound distribution scheduling: Review and extensions
-
to appear
-
Chen Z-L (2009). Integrated production and outbound distribution scheduling: Review and extensions. Opns Res, to appear.
-
(2009)
Opns Res
-
-
Chen, Z.-L.1
-
33
-
-
38549131389
-
Supply chain scheduling: Conflict and cooperation in assembly systems
-
Chen Z-L and Hall NG (2007). Supply chain scheduling: Conflict and cooperation in assembly systems. Opns Res 55: 1072-1089.
-
(2007)
Opns Res
, vol.55
, pp. 1072-1089
-
-
Chen, Z.-L.1
Hall, N.G.2
-
34
-
-
0006715283
-
(1.999). Solving parallel machine scheduling problems by column generation
-
Chen Z-L and Powell WB (1.999). Solving parallel machine scheduling problems by column generation. INFORMS J Comput 11: 78-94.
-
INFORMS J Comput
, vol.11
, pp. 78-94
-
-
Chen, Z.-L.1
Powell, W.B.2
-
35
-
-
0039163654
-
Scheduling with delivery and earliness penalties
-
Cheng TCE and Kahlbacher HG (1993). Scheduling with delivery and earliness penalties. Asia-Pacific J Opl Res 10: 145-152.
-
(1993)
Asia-Pacific J Opl Res
, vol.10
, pp. 145-152
-
-
Cheng, T.C.E.1
Kahlbacher, H.G.2
-
36
-
-
0013238227
-
An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
-
Congram RK, Potts CN and Van de Velde SL (2002). An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS J Comput 14: 52-67.
-
(2002)
INFORMS J Comput
, vol.14
, pp. 52-67
-
-
Congram, R.K.1
Potts, C.N.2
Van de Velde, S.L.3
-
38
-
-
85059770931
-
The complexity of theorem-proving procedures
-
The Association for Computing Machinery: New York, pp
-
Cook SA (1971). The complexity of theorem-proving procedures. In: Proceedings of the 3rd Annual ACM Symposium on Theory of Computing. The Association for Computing Machinery: New York, pp 151-158.
-
(1971)
Proceedings of the 3rd Annual ACM Symposium on Theory of Computing
, pp. 151-158
-
-
Cook, S.A.1
-
39
-
-
0001234583
-
Local search heuristics for the single machine total weighted tardiness scheduling problem
-
Crauwels HAJ, Potts CN and Van Wassenhove (1998). Local search heuristics for the single machine total weighted tardiness scheduling problem. INFORMS J Comput 10: 341-350.
-
(1998)
INFORMS J Comput
, vol.10
, pp. 341-350
-
-
Crauwels, H.A.J.1
Potts, C.N.2
Wassenhove, V.3
-
40
-
-
0001237146
-
A method for solving traveling-salesman problems
-
Croes GA (1958). A method for solving traveling-salesman problems. Opns Res 6: 791-812.
-
(1958)
Opns Res
, vol.6
, pp. 791-812
-
-
Croes, G.A.1
-
41
-
-
0000546002
-
Solving large-scale symmetric travelling salesman problems to optimality
-
Crowder H and Padberg MW (1980). Solving large-scale symmetric travelling salesman problems to optimality. Mngt Sci 26: 495-509.
-
(1980)
Mngt Sci
, vol.26
, pp. 495-509
-
-
Crowder, H.1
Padberg, M.W.2
-
44
-
-
34250074609
-
Applying tabu-search to the job-shop scheduling problem
-
Dell'Amico M and Trubian M (1993). Applying tabu-search to the job-shop scheduling problem. Ann Opns Res 41: 231-252.
-
(1993)
Ann Opns Res
, vol.41
, pp. 231-252
-
-
Dell'Amico, M.1
Trubian, M.2
-
45
-
-
0009111952
-
-
Dempster MAH, Lenstra JJ and Rinnooy Kan AHG eds, Reidel: Dordrecht, the Netherlands
-
Dempster MAH, Lenstra JJ and Rinnooy Kan AHG (eds). (1982). Deterministic and Stochastic Scheduling. Reidel: Dordrecht, the Netherlands,
-
(1982)
Deterministic and Stochastic Scheduling
-
-
-
46
-
-
0010534258
-
On some combinatorial problems arising in scheduling
-
de Werra D (1970). On some combinatorial problems arising in scheduling. CORS J 8: 165-175.
-
(1970)
CORS J
, vol.8
, pp. 165-175
-
-
de Werra, D.1
-
47
-
-
0042475498
-
Graph-theoretical models for preemptive scheduling
-
Slowinski R and Weglarz J eds, Elsevier: Amsterdam, pp
-
de Werra D (1989). Graph-theoretical models for preemptive scheduling. In: Slowinski R and Weglarz J (eds). Advances in Project Scheduling. Elsevier: Amsterdam, pp 171-185.
-
(1989)
Advances in Project Scheduling
, pp. 171-185
-
-
de Werra, D.1
-
48
-
-
0029215084
-
Evolution based learning in a job shop scheduling environment
-
Dorndorf U and Pesch E (1995). Evolution based learning in a job shop scheduling environment. Comput Opns Res 22: 25-40.
-
(1995)
Comput Opns Res
, vol.22
, pp. 25-40
-
-
Dorndorf, U.1
Pesch, E.2
-
49
-
-
0000474126
-
Minimizing total tardiness on one machine is NP-hard
-
Du J and Leung JY-T (1990). Minimizing total tardiness on one machine is NP-hard. Math Opns Res 15: 483-495.
-
(1990)
Math Opns Res
, vol.15
, pp. 483-495
-
-
Du, J.1
Leung, J.Y.-T.2
-
50
-
-
64749087980
-
-
Linear programming with pattern constraints. PhD thesis, Report No. BL, The Computation Laboratory, Harvard University
-
Eastman WL (1958a). Linear programming with pattern constraints. PhD thesis, Report No. BL. 20, The Computation Laboratory, Harvard University.
-
(1958)
, pp. 20
-
-
Eastman, W.L.1
-
52
-
-
0000927535
-
Paths, trees, and flowers
-
Edmonds J (1965). Paths, trees, and flowers. Canad J Math 17: 449-467.
-
(1965)
Canad J Math
, vol.17
, pp. 449-467
-
-
Edmonds, J.1
-
53
-
-
0001169995
-
The one-machine sequencing problem with delay costs
-
Elmaghraby SE (1968). The one-machine sequencing problem with delay costs. J Indust Eng 19: 105-108.
-
(1968)
J Indust Eng
, vol.19
, pp. 105-108
-
-
Elmaghraby, S.E.1
-
54
-
-
0014535952
-
One-machine sequencing to minimize certain functions of job tardiness
-
Emmons H (1969). One-machine sequencing to minimize certain functions of job tardiness. Opns Res 17: 701-715.
-
(1969)
Opns Res
, vol.17
, pp. 701-715
-
-
Emmons, H.1
-
56
-
-
0003055268
-
Preemptive scheduling of uniform machines by ordinary network flow techniques
-
Federgruen A and Groenvelt H (1986). Preemptive scheduling of uniform machines by ordinary network flow techniques. Mngt Sci 32: 341-349.
-
(1986)
Mngt Sci
, vol.32
, pp. 341-349
-
-
Federgruen, A.1
Groenvelt, H.2
-
57
-
-
0017240964
-
A dual algorithm for the one-machine scheduling problem
-
Fisher ML (1976). A dual algorithm for the one-machine scheduling problem. Math Progr 11: 229-251.
-
(1976)
Math Progr
, vol.11
, pp. 229-251
-
-
Fisher, M.L.1
-
58
-
-
0001118054
-
Algorithms for edge coloring bipartite graphs
-
Gabow HN and Kariv O (1982). Algorithms for edge coloring bipartite graphs. SIAM J Comput 11: 117-129.
-
(1982)
SIAM J Comput
, vol.11
, pp. 117-129
-
-
Gabow, H.N.1
Kariv, O.2
-
59
-
-
40549104520
-
Work, Wages, and Profits
-
2nd edn, Co: New York, reprinted by Hive Publishing Company: Easton, Maryland, 1973
-
Gantt HL (1916). Work, Wages, and Profits, 2nd edn. Engineering Magazine Co: New York, (reprinted by Hive Publishing Company: Easton, Maryland, 1973).
-
(1916)
Engineering Magazine
-
-
Gantt, H.L.1
-
61
-
-
0016952078
-
The complexity of flowshop and jobshop scheduling
-
Garey MR, Johnson DS and Sethi R (1976). The complexity of flowshop and jobshop scheduling. Math Opns Res 1: 117-129.
-
(1976)
Math Opns Res
, vol.1
, pp. 117-129
-
-
Garey, M.R.1
Johnson, D.S.2
Sethi, R.3
-
62
-
-
0015991935
-
-
Gelders L and Kleindorfer PR (1.974). Coordinating aggregate and detailed scheduling decisions in the one-machine job shop: Part I, Theory. Opns Res 22: 46-60.
-
Gelders L and Kleindorfer PR (1.974). Coordinating aggregate and detailed scheduling decisions in the one-machine job shop: Part I, Theory. Opns Res 22: 46-60.
-
-
-
-
63
-
-
0016485364
-
Coordinating aggregate and detailed scheduling decisions in the one-machine job shop: Part II, Computation and structure
-
Gelders L and Kleindorfer PR (1975). Coordinating aggregate and detailed scheduling decisions in the one-machine job shop: Part II, Computation and structure. Opns Res 23: 312-324.
-
(1975)
Opns Res
, vol.23
, pp. 312-324
-
-
Gelders, L.1
Kleindorfer, P.R.2
-
64
-
-
0001068310
-
Sequencing a one-state variable machine: A. solvable case of the traveling salesman problem
-
Gilmore PC and Gomory RE (1964). Sequencing a one-state variable machine: A. solvable case of the traveling salesman problem. Opns Res 12: 665-679.
-
(1964)
Opns Res
, vol.12
, pp. 665-679
-
-
Gilmore, P.C.1
Gomory, R.E.2
-
65
-
-
0022865373
-
-
1.986, Future paths for integer programming and links to artificial intelligence
-
Glover F (1.986). Future paths for integer programming and links to artificial intelligence. Comput Opns Res 13: 533-549.
-
Comput Opns Res
, vol.13
, pp. 533-549
-
-
Glover, F.1
-
66
-
-
0000411214
-
Tabu search: Part I
-
Glover F (1989). Tabu search: Part I. ORSA J Comput 1: 190-206.
-
(1989)
ORSA J Comput
, vol.1
, pp. 190-206
-
-
Glover, F.1
-
67
-
-
0001724713
-
Tabu search: Part II
-
Glover F (1990). Tabu search: Part II. ORSA J Comput 2: 4-32.
-
(1990)
ORSA J Comput
, vol.2
, pp. 4-32
-
-
Glover, F.1
-
69
-
-
0017012325
-
Open shop scheduling to minimize finish time
-
Mach
-
Gonzalez T and Sahni S (1976). Open shop scheduling to minimize finish time. J Assoc Comput Mach 23: 665-679.
-
(1976)
J Assoc Comput
, vol.23
, pp. 665-679
-
-
Gonzalez, T.1
Sahni, S.2
-
70
-
-
0017918132
-
Flowshop and jobshop schedules: Complexity and approximation
-
Gonzalez T and Sahni S (1978). Flowshop and jobshop schedules: Complexity and approximation. Opns Res 26: 36-52.
-
(1978)
Opns Res
, vol.26
, pp. 36-52
-
-
Gonzalez, T.1
Sahni, S.2
-
71
-
-
84944813080
-
Bounds for certain multiprocessing anomalies
-
Graham RL (1966). Bounds for certain multiprocessing anomalies. Bell Syst Techn J 45: 1563-1581.
-
(1966)
Bell Syst Techn J
, vol.45
, pp. 1563-1581
-
-
Graham, R.L.1
-
72
-
-
0014477093
-
Bounds on multiprocessing timing anomalies
-
Graham RL (1969). Bounds on multiprocessing timing anomalies. SIAM J Appl Math 17: 416-429.
-
(1969)
SIAM J Appl Math
, vol.17
, pp. 416-429
-
-
Graham, R.L.1
-
73
-
-
74849101820
-
Optimization and approximation in deterministic sequencing and scheduling: A survey
-
S
-
Graham RL, Lawler EL, Lenstra JK and Rinnooy Kan AHG (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann Disc Math S: 287-326.
-
(1979)
Ann Disc Math
, pp. 287-326
-
-
Graham, R.L.1
Lawler, E.L.2
Lenstra, J.K.3
Rinnooy Kan, A.H.G.4
-
74
-
-
0002931408
-
On the symmetric travelling salesman problem: Solution of a 120-city problem
-
Grötschel M (1980). On the symmetric travelling salesman problem: Solution of a 120-city problem. Math Progr Study 12: 61-77.
-
(1980)
Math Progr Study
, vol.12
, pp. 61-77
-
-
Grötschel, M.1
-
75
-
-
0040376251
-
An improved combinatorial algorithm for the flowshop-scheduling problem
-
Gupta JND (1971). An improved combinatorial algorithm for the flowshop-scheduling problem. Opns Res 19: 1753-1758.
-
(1971)
Opns Res
, vol.19
, pp. 1753-1758
-
-
Gupta, J.N.D.1
-
76
-
-
0042765233
-
Approximability of flow shop scheduling
-
Hall LA (1998). Approximability of flow shop scheduling. Math Progr B 82: 175-190.
-
(1998)
Math Progr B
, vol.82
, pp. 175-190
-
-
Hall, L.A.1
-
77
-
-
0031207982
-
Scheduling to minimize average completion time: Off-line and on-line approximation algorithms
-
Hall LA, Schulz A, Shmoys DB and Wein J (1997). Scheduling to minimize average completion time: Off-line and on-line approximation algorithms. Math Opns Res 22: 513-544.
-
(1997)
Math Opns Res
, vol.22
, pp. 513-544
-
-
Hall, L.A.1
Schulz, A.2
Shmoys, D.B.3
Wein, J.4
-
78
-
-
0026223840
-
Earliness-tardiness scheduling problems, I: Weighted deviation of completion times about a common due date
-
Hall NG and Posner ME (1991). Earliness-tardiness scheduling problems, I: Weighted deviation of completion times about a common due date. Opns Res 39: 836-846.
-
(1991)
Opns Res
, vol.39
, pp. 836-846
-
-
Hall, N.G.1
Posner, M.E.2
-
79
-
-
2342539189
-
Supply chain scheduling: Batching and delivery
-
Hall NG and Potts CN (1993). Supply chain scheduling: Batching and delivery. Opns Res 51: 566-584.
-
(1993)
Opns Res
, vol.51
, pp. 566-584
-
-
Hall, N.G.1
Potts, C.N.2
-
80
-
-
0026223827
-
-
Hall NG, Kubiak W and Sethi SP (1991). Earliness-tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date. Opns Res 39: 836-846.
-
Hall NG, Kubiak W and Sethi SP (1991). Earliness-tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date. Opns Res 39: 836-846.
-
-
-
-
81
-
-
0019342692
-
An algorithm for single machine sequencing with release dates to minimize total weighted completion time
-
Hariri AMA and Potts CN (1983). An algorithm for single machine sequencing with release dates to minimize total weighted completion time. Disc Appl Math 5: 99-109.
-
(1983)
Disc Appl Math
, vol.5
, pp. 99-109
-
-
Hariri, A.M.A.1
Potts, C.N.2
-
82
-
-
34250461535
-
The traveling-salesman problem and minimum spanning trees: Part II
-
Held M and Karp RM (1971). The traveling-salesman problem and minimum spanning trees: Part II. Math Progr 1: 6-25.
-
(1971)
Math Progr
, vol.1
, pp. 6-25
-
-
Held, M.1
Karp, R.M.2
-
83
-
-
0016025814
-
Validation of subgradient optimization
-
Held M, Wolfe P and Crowder HP (1974). Validation of subgradient optimization. Math Progr 6: 62-88.
-
(1974)
Math Progr
, vol.6
, pp. 62-88
-
-
Held, M.1
Wolfe, P.2
Crowder, H.P.3
-
84
-
-
0031270468
-
Scheduling semiconductor burnin operations to minimize total flowtime
-
Hochbaum DS and Landy D (1997). Scheduling semiconductor burnin operations to minimize total flowtime. Opns Res 45: 874-885.
-
(1997)
Opns Res
, vol.45
, pp. 874-885
-
-
Hochbaum, D.S.1
Landy, D.2
-
85
-
-
0023170393
-
Using dual approximation algorithms for scheduling problems: Theoretical and practical results
-
Mach
-
Hochbaum DS and Shmoys DB (1987). Using dual approximation algorithms for scheduling problems: Theoretical and practical results. J Assoc Comput Mach 34: 144-162.
-
(1987)
J Assoc Comput
, vol.34
, pp. 144-162
-
-
Hochbaum, D.S.1
Shmoys, D.B.2
-
86
-
-
0024018137
-
A polynomial approximation scheme for machine scheduling on uniform processors: Using the dual approximating approach
-
Hochbaum DS and Shmoys DB (1988). A polynomial approximation scheme for machine scheduling on uniform processors: Using the dual approximating approach. SIAM J Comput 17: 539-551.
-
(1988)
SIAM J Comput
, vol.17
, pp. 539-551
-
-
Hochbaum, D.S.1
Shmoys, D.B.2
-
87
-
-
0026260399
-
Scheduling around a small common due date
-
Hoogeveen JA and Van de Velde SL (1991). Scheduling around a small common due date. Eur J Opl Res 55: 237-242.
-
(1991)
Eur J Opl Res
, vol.55
, pp. 237-242
-
-
Hoogeveen, J.A.1
Van de Velde, S.L.2
-
88
-
-
84947903026
-
Optimal online algorithms for single-machine scheduling
-
Cunningham WH, McCormick ST and Queyranne M Eds, Integer Programming and Combinatorial Optimization, Springer: Berlin, pp
-
Hoogeveen JA and Vestjens APA (1996). Optimal online algorithms for single-machine scheduling. In: Cunningham WH, McCormick ST and Queyranne M (Eds). Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, Vol. 1084. Springer: Berlin, pp 404-414.
-
(1996)
Lecture Notes in Computer Science
, vol.1084
, pp. 404-414
-
-
Hoogeveen, J.A.1
Vestjens, A.P.A.2
-
89
-
-
0027927220
-
(1.994). New lower and upper bounds for scheduling around a small common due date
-
Hoogeveen JA, Oosterhout H and Van de Velde SL (1.994). New lower and upper bounds for scheduling around a small common due date. Opns Res 42: 102-110.
-
Opns Res
, vol.42
, pp. 102-110
-
-
Hoogeveen, J.A.1
Oosterhout, H.2
Van de Velde, S.L.3
-
90
-
-
0003346235
-
Sequencing and scheduling
-
Dell'Amico M, Maffioli F and Martello S eds, Wiley: Chichester, pp
-
Hoogeveen JA, Lenstra JK and Van de Velde SL (1997). Sequencing and scheduling. In: Dell'Amico M, Maffioli F and Martello S (eds). Annotated Bibliographies in Combinatorial Optimization. Wiley: Chichester, pp 181-197.
-
(1997)
Annotated Bibliographies in Combinatorial Optimization
, pp. 181-197
-
-
Hoogeveen, J.A.1
Lenstra, J.K.2
Van de Velde, S.L.3
-
91
-
-
0011508774
-
Nonapproximability results for scheduling problems with minsum criteria
-
Hoogeveen H, Schuurman P and Woeginger GJ (2001). Nonapproximability results for scheduling problems with minsum criteria. INFORMS J Comput 13: 157-168.
-
(2001)
INFORMS J Comput
, vol.13
, pp. 157-168
-
-
Hoogeveen, H.1
Schuurman, P.2
Woeginger, G.J.3
-
92
-
-
0016034348
-
Some simple scheduling algorithms
-
Horn WA (1974). Some simple scheduling algorithms. Nav Res Logist Quart 21: 177-185.
-
(1974)
Nav Res Logist Quart
, vol.21
, pp. 177-185
-
-
Horn, W.A.1
-
93
-
-
0016943203
-
Exact and approximate algorithms for scheduling nonidentical processors
-
Mach
-
Horowitz H and Sahni S (1976). Exact and approximate algorithms for scheduling nonidentical processors. J Assoc Comput Mach 23: 317-327.
-
(1976)
J Assoc Comput
, vol.23
, pp. 317-327
-
-
Horowitz, H.1
Sahni, S.2
-
94
-
-
0016560084
-
Fast approximation algorithms for the knapsack and sum of subset problems
-
Mach
-
Ibarra OH and Kim CE (1975). Fast approximation algorithms for the knapsack and sum of subset problems. J Assoc Comput Mach 22: 463-468.
-
(1975)
J Assoc Comput
, vol.22
, pp. 463-468
-
-
Ibarra, O.H.1
Kim, C.E.2
-
95
-
-
0000177367
-
Application of the branch and bound technique to some flow-shop scheduling problems
-
Ignall E and Schrage L (1965). Application of the branch and bound technique to some flow-shop scheduling problems. Opns Res 13: 400-412.
-
(1965)
Opns Res
, vol.13
, pp. 400-412
-
-
Ignall, E.1
Schrage, L.2
-
96
-
-
0042182628
-
Scheduling aproduction line to minimize maximum tardiness
-
Management Science Research Project, University of California, Los Angeles, CA
-
Jackson JR (1955). Scheduling aproduction line to minimize maximum tardiness. Research Report 43, Management Science Research Project, University of California, Los Angeles, CA.
-
(1955)
Research Report
, vol.43
-
-
Jackson, J.R.1
-
97
-
-
0040362439
-
An extension of Johnson's result on job lot scheduling
-
Jackson JR (1956). An extension of Johnson's result on job lot scheduling. Nav Res Logist Quart 3: 201-203.
-
(1956)
Nav Res Logist Quart
, vol.3
, pp. 201-203
-
-
Jackson, J.R.1
-
98
-
-
0003075019
-
Optimal two- and three-stage production schedules with, setup times included
-
Johnson SM (1954). Optimal two- and three-stage production schedules with, setup times included. Nav Res Logist Quart 1: 61-68.
-
(1954)
Nav Res Logist Quart
, vol.1
, pp. 61-68
-
-
Johnson, S.M.1
-
99
-
-
85046380112
-
A new polynomial-time algorithm for linear programming
-
The Association for Computing Machinery: New York, pp
-
Karmarkar N (1984). A new polynomial-time algorithm for linear programming. In: Proceedings of the 16th Annual ACM Symposium on Theory of Computing. The Association for Computing Machinery: New York, pp 302-311.
-
(1984)
Proceedings of the 16th Annual ACM Symposium on Theory of Computing
, pp. 302-311
-
-
Karmarkar, N.1
-
100
-
-
0003037529
-
Reducibility among combinatorial problems
-
Miller RE and Thatcher JM eds, Plenum Press: New York, pp
-
Karp RM (1972). Reducibility among combinatorial problems. In: Miller RE and Thatcher JM (eds). Complexity of Computer Computations. Plenum Press: New York, pp 85-103.
-
(1972)
Complexity of Computer Computations
, pp. 85-103
-
-
Karp, R.M.1
-
101
-
-
0000564361
-
A polynomial algorithm in linear programming
-
Khachiyan LG (1979). A polynomial algorithm in linear programming. Sov Math Doklady 20: 191-194.
-
(1979)
Sov Math Doklady
, vol.20
, pp. 191-194
-
-
Khachiyan, L.G.1
-
103
-
-
38249004716
-
Two-machine shop scheduling problems with batch processing
-
Kleinau U (1993). Two-machine shop scheduling problems with batch processing. Math Comput Model 17: 55-66.
-
(1993)
Math Comput Model
, vol.17
, pp. 55-66
-
-
Kleinau, U.1
-
104
-
-
0036699898
-
A linear time approximation scheme for makespan minimization in an open shop with release dates
-
Kononov A and Sviridenko M (2002). A linear time approximation scheme for makespan minimization in an open shop with release dates. Opns Res Lett 30: 276-280.
-
(2002)
Opns Res Lett
, vol.30
, pp. 276-280
-
-
Kononov, A.1
Sviridenko, M.2
-
105
-
-
0033346202
-
A fully polynomial approximation scheme for weighted earliness-tardiness problem
-
Kovalyov MY and Kubiak W (1999). A fully polynomial approximation scheme for weighted earliness-tardiness problem. Opns Res 47: 757-761.
-
(1999)
Opns Res
, vol.47
, pp. 757-761
-
-
Kovalyov, M.Y.1
Kubiak, W.2
-
106
-
-
33749503018
-
Planning machine maintenance in two-machine shop scheduling
-
Kubzin MA and Strusevich. VA (2006). Planning machine maintenance in two-machine shop scheduling. Opns Res 54: 789-800.
-
(2006)
Opns Res
, vol.54
, pp. 789-800
-
-
Kubzin, M.A.1
Strusevich, V.A.2
-
107
-
-
52049119968
-
Approximation results for flow shop scheduling problems with machine availability constraints
-
Kubzin MA, Potts CN and Strusevich. VA (2009). Approximation results for flow shop scheduling problems with machine availability constraints. Comput Opns Res 36: 379-390.
-
(2009)
Comput Opns Res
, vol.36
, pp. 379-390
-
-
Kubzin, M.A.1
Potts, C.N.2
Strusevich, V.A.3
-
108
-
-
0002087256
-
Preemptive scheduling of uniform machines subject to release dates
-
Pulleyblank WR ed, Academic Press: New York, pp
-
Labetoulle J, Lawler EL, Lenstra JK and Rinnooy Kan AHG (1984). Preemptive scheduling of uniform machines subject to release dates. In: Pulleyblank WR (ed). Progress in Combinatorial Optimization. Academic Press: New York, pp 245-261.
-
(1984)
Progress in Combinatorial Optimization
, pp. 245-261
-
-
Labetoulle, J.1
Lawler, E.L.2
Lenstra, J.K.3
Rinnooy Kan, A.H.G.4
-
109
-
-
0017908060
-
A general bounding scheme for the permutation flow-shop problem
-
Lageweg BJ, Lenstra JK and Rinnooy Kan AHG (1978). A general bounding scheme for the permutation flow-shop problem. Opns Res 26: 53-67.
-
(1978)
Opns Res
, vol.26
, pp. 53-67
-
-
Lageweg, B.J.1
Lenstra, J.K.2
Rinnooy Kan, A.H.G.3
-
111
-
-
0001173632
-
An automatic method for solving discrete programming problems
-
Land AH and Doig A (1960). An automatic method for solving discrete programming problems. Econometrica 28: 497-520.
-
(1960)
Econometrica
, vol.28
, pp. 497-520
-
-
Land, A.H.1
Doig, A.2
-
112
-
-
0001551208
-
On scheduling problems with deferral costs
-
Lawler EL (1964). On scheduling problems with deferral costs. Mngt Sci 11: 280-288.
-
(1964)
Mngt Sci
, vol.11
, pp. 280-288
-
-
Lawler, E.L.1
-
113
-
-
77957077792
-
A 'pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness
-
Lawler EL (1977). A 'pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness. Ann Disc Math 1: 331-342.
-
(1977)
Ann Disc Math
, vol.1
, pp. 331-342
-
-
Lawler, E.L.1
-
114
-
-
77951587888
-
Sequencing jobs to minimize total weighted completion time subject to precedence constraints
-
Lawler EL (1978). Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Ann Disc Math 2: 75-90.
-
(1978)
Ann Disc Math
, vol.2
, pp. 75-90
-
-
Lawler, E.L.1
-
116
-
-
0018020599
-
On preemptive scheduling of unrelated parallel processors by linear programming
-
Mach
-
Lawler EL and Labetoulle J (1978). On preemptive scheduling of unrelated parallel processors by linear programming. J Assoc Comput Mach 25: 612-619.
-
(1978)
J Assoc Comput
, vol.25
, pp. 612-619
-
-
Lawler, E.L.1
Labetoulle, J.2
-
117
-
-
0014571702
-
A functional equation and its application to resource allocation and sequencing problems
-
Lawler EL and Moore JM (1969). A functional equation and its application to resource allocation and sequencing problems. Mngt Sci 16: 77-84.
-
(1969)
Mngt Sci
, vol.16
, pp. 77-84
-
-
Lawler, E.L.1
Moore, J.M.2
-
118
-
-
0007992513
-
Recent developments in deterministic sequencing and scheduling: A survey
-
Dempster MAH, Lenstra JK and Rinnooy Kan AHG eds, Reidel: Dordrecht, pp
-
Lawler EL, Lenstra JK and Rinnooy Kan AHG (1982a). Recent developments in deterministic sequencing and scheduling: A survey. In: Dempster MAH, Lenstra JK and Rinnooy Kan AHG (eds). Deterministic and. Stochastic Scheduling. Reidel: Dordrecht, pp 35-73.
-
(1982)
Deterministic and. Stochastic Scheduling
, pp. 35-73
-
-
Lawler, E.L.1
Lenstra, J.K.2
Rinnooy Kan, A.H.G.3
-
120
-
-
0345901561
-
-
Lawler EL, Lenstra JK, Rinnooy Kan AHG and Shmoys DB (1993). Sequencing and scheduling: Algorithms and complexity. In: Graves S, Rinnooy Kan AHG and Zipkin P (Eds). Handbooks in Operations Research and Management Science, 4, Logistics of Production and Inventory, North Holland: Amsterdam, pp 445-522.
-
Lawler EL, Lenstra JK, Rinnooy Kan AHG and Shmoys DB (1993). Sequencing and scheduling: Algorithms and complexity. In: Graves S, Rinnooy Kan AHG and Zipkin P (Eds). Handbooks in Operations Research and Management Science, Volume 4, Logistics of Production and Inventory, North Holland: Amsterdam, pp 445-522.
-
-
-
-
121
-
-
0000541519
-
Machine scheduling with an availability constraint
-
Lee C-Y (1996). Machine scheduling with an availability constraint. J Global Opti 9: 395-416.
-
(1996)
J Global Opti
, vol.9
, pp. 395-416
-
-
Lee, C.-Y.1
-
122
-
-
84944560904
-
Machine scheduling with availability constraints
-
Leung JY-T ed, Chapman & Hall/CRC: Boca Raton, FL, pp
-
Lee C-Y (2004). Machine scheduling with availability constraints. In: Leung JY-T (ed). Handbook of Scheduling: Algorithms, Models and Performance Analysis. Chapman & Hall/CRC: Boca Raton, FL, pp 22-1-22-13.
-
(2004)
Handbook of Scheduling: Algorithms, Models and Performance Analysis
-
-
Lee, C.-Y.1
-
123
-
-
0034159705
-
Scheduling jobs and maintenance activities on parallel machines
-
Lee C-Y and Chen Z-L (2000). Scheduling jobs and maintenance activities on parallel machines. Nav Res Logist 47: 145-165.
-
(2000)
Nav Res Logist
, vol.47
, pp. 145-165
-
-
Lee, C.-Y.1
Chen, Z.-L.2
-
124
-
-
0344427189
-
Machine scheduling with. transportation considerations
-
Lee C-Y and Chen Z-L (2001). Machine scheduling with. transportation considerations. J Schedul 4: 3-24.
-
(2001)
J Schedul
, vol.4
, pp. 3-24
-
-
Lee, C.-Y.1
Chen, Z.-L.2
-
125
-
-
0035200203
-
Machine scheduling with a rate-modifying activity
-
Lee C-Y and Leon J (2001). Machine scheduling with a rate-modifying activity. Eur J Opl Res 128: 119-128.
-
(2001)
Eur J Opl Res
, vol.128
, pp. 119-128
-
-
Lee, C.-Y.1
Leon, J.2
-
126
-
-
3142641343
-
The mystical power of twoness: In memoriam Eugene L. Lawler
-
Lenstra JK (1998). The mystical power of twoness: In memoriam Eugene L. Lawler. J Schedul 1: 3-14.
-
(1998)
J Schedul
, vol.1
, pp. 3-14
-
-
Lenstra, J.K.1
-
127
-
-
0017924416
-
Complexity of scheduling under precedence constraints
-
Lenstra JK and Rinnooy Kan AHG (1978). Complexity of scheduling under precedence constraints. Opns Res 26: 22-35.
-
(1978)
Opns Res
, vol.26
, pp. 22-35
-
-
Lenstra, J.K.1
Rinnooy Kan, A.H.G.2
-
129
-
-
0000438412
-
Approximation algorithms for scheduling unrelated parallel machines
-
Lenstra JK, Shmoys DB and Tardos É (1990). Approximation algorithms for scheduling unrelated parallel machines. Math Progr. 46: 259-271.
-
(1990)
Math Progr
, vol.46
, pp. 259-271
-
-
Lenstra, J.K.1
Shmoys, D.B.2
Tardos, E.3
-
131
-
-
84908780328
-
Computer solutions of the traveling salesman problem
-
Lin S (1965). Computer solutions of the traveling salesman problem. Bell Syst Techn J 44: 2245-2269.
-
(1965)
Bell Syst Techn J
, vol.44
, pp. 2245-2269
-
-
Lin, S.1
-
132
-
-
13544266043
-
Scheduling groups of jobs in two-machine open shop
-
in Chinese
-
Liu Z and Yu W (2000). Scheduling groups of jobs in two-machine open shop. J East China Univ Sci Technol 26: 665-669 (in Chinese).
-
(2000)
J East China Univ Sci Technol
, vol.26
, pp. 665-669
-
-
Liu, Z.1
Yu, W.2
-
133
-
-
0040970477
-
A 'branch-and-bound' algorithm for the exact solution of the three-machine scheduling problem
-
Lomnicki ZA (1965). A 'branch-and-bound' algorithm for the exact solution of the three-machine scheduling problem. Opl Res Quart 16: 89-100.
-
(1965)
Opl Res Quart
, vol.16
, pp. 89-100
-
-
Lomnicki, Z.A.1
-
134
-
-
0020159813
-
Preemptive scheduling with release times, deadlines and due times
-
Mach
-
Martel CU (1982). Preemptive scheduling with release times, deadlines and due times. J Assoc Comput Mach 29: 812-829.
-
(1982)
J Assoc Comput
, vol.29
, pp. 812-829
-
-
Martel, C.U.1
-
135
-
-
0003657544
-
-
Working paper 03-04-88, Graduate School of Business, University of Texas at Austin, TX
-
Matsuo H, Suh CJ and Sullivan RS (1988). A controlled search simulated annealing method for the general problem. Working paper 03-04-88, Graduate School of Business, University of Texas at Austin, TX.
-
(1988)
A controlled search simulated annealing method for the general problem
-
-
Matsuo, H.1
Suh, C.J.2
Sullivan, R.S.3
-
136
-
-
0004779059
-
A controlled search simulated annealing method for the single machine weighted tardiness problem
-
Matsuo H, Suh CJ and Sullivan RS (1989). A controlled search simulated annealing method for the single machine weighted tardiness problem. Ann Opns Res 21: 85-108.
-
(1989)
Ann Opns Res
, vol.21
, pp. 85-108
-
-
Matsuo, H.1
Suh, C.J.2
Sullivan, R.S.3
-
137
-
-
0040376237
-
Optimal production schedules for flowshops
-
McMahon GB (1969). Optimal production schedules for flowshops. CORS J 7: 141-151.
-
(1969)
CORS J
, vol.7
, pp. 141-151
-
-
McMahon, G.B.1
-
138
-
-
0010761199
-
Flow-shop scheduling with the branch-and-bound method
-
McMahon GB and Burton PG (1967). Flow-shop scheduling with the branch-and-bound method. Opns Res 15: 473-481.
-
(1967)
Opns Res
, vol.15
, pp. 473-481
-
-
McMahon, G.B.1
Burton, P.G.2
-
139
-
-
0016511108
-
On scheduling with ready times and due dates to minimize maximum lateness
-
McMahon GB and Florian M (1975). On scheduling with ready times and due dates to minimize maximum lateness. Opns Res 23: 475-482.
-
(1975)
Opns Res
, vol.23
, pp. 475-482
-
-
McMahon, G.B.1
Florian, M.2
-
140
-
-
0002643827
-
Scheduling with deadlines and loss functions
-
McNaughton R (1959). Scheduling with deadlines and loss functions. Mngt Sci 6: 1-12.
-
(1959)
Mngt Sci
, vol.6
, pp. 1-12
-
-
McNaughton, R.1
-
141
-
-
34250385999
-
Integer programming approaches to the travelling salesman problem
-
Miliotis P (1976). Integer programming approaches to the travelling salesman problem. Math Progr 10: 367-378.
-
(1976)
Math Progr
, vol.10
, pp. 367-378
-
-
Miliotis, P.1
-
142
-
-
34250285237
-
Using cutting planes to solve the symmetric travelling salesman problem
-
Miliotis P (1978). Using cutting planes to solve the symmetric travelling salesman problem. Math Progr 15: 177-188.
-
(1978)
Math Progr
, vol.15
, pp. 177-188
-
-
Miliotis, P.1
-
143
-
-
0024736520
-
On the complexity of scheduling with batch setup times
-
Monma CL and Potts CN (1989). On the complexity of scheduling with batch setup times. Opns Res 37: 798-804.
-
(1989)
Opns Res
, vol.37
, pp. 798-804
-
-
Monma, C.L.1
Potts, C.N.2
-
144
-
-
0000281691
-
A concise survey of efficiently solvable cases of the permutation flow-shop problem
-
Monma CL and Rinnooy Kan AHG (1983). A concise survey of efficiently solvable cases of the permutation flow-shop problem. RAIRO Rech Oper 17: 105-119.
-
(1983)
RAIRO Rech Oper
, vol.17
, pp. 105-119
-
-
Monma, C.L.1
Rinnooy Kan, A.H.G.2
-
145
-
-
0018501967
-
Sequencing with series-parallel precedence constraints
-
Monma CL and Sidney JB (1979). Sequencing with series-parallel precedence constraints. Math Opns Res 4: 215-234.
-
(1979)
Math Opns Res
, vol.4
, pp. 215-234
-
-
Monma, C.L.1
Sidney, J.B.2
-
146
-
-
0000062028
-
An n job, one machine sequencing algorithm for minimizing the number of late jobs
-
Moore JM (1968). An n job, one machine sequencing algorithm for minimizing the number of late jobs. Mngt Sci 15: 102-109.
-
(1968)
Mngt Sci
, vol.15
, pp. 102-109
-
-
Moore, J.M.1
-
147
-
-
0004168233
-
-
Muth JF and Thompson GL eds, Prentice-Hall, Englewood Cliffs, NJ
-
Muth JF and Thompson GL (eds). (1963). Industrial Scheduling. Prentice-Hall, Englewood Cliffs, NJ.
-
(1963)
Industrial Scheduling
-
-
-
148
-
-
0008675787
-
The order of n items processed on m machines: I
-
Nabeshima I (1961). The order of n items processed on m machines: I. J Opns Res Soc Japan 3: 170-175.
-
(1961)
J Opns Res Soc Japan
, vol.3
, pp. 170-175
-
-
Nabeshima, I.1
-
149
-
-
0040918634
-
On the bound of makespans and its application in M machine scheduling problem
-
Nabeshima I (1967). On the bound of makespans and its application in M machine scheduling problem. J Opns Res Soc Japan 9: 98-136.
-
(1967)
J Opns Res Soc Japan
, vol.9
, pp. 98-136
-
-
Nabeshima, I.1
-
150
-
-
64749098254
-
Das Reihenfolgeproblem in der Fertigungsprogrammierung und Linear-planung mit logischen Bedingungen
-
Németi L (1964). Das Reihenfolgeproblem in der Fertigungsprogrammierung und Linear-planung mit logischen Bedingungen. Mathematica (Cluj) 6: 87-99.
-
(1964)
Mathematica (Cluj)
, vol.6
, pp. 87-99
-
-
Németi, L.1
-
151
-
-
1842611454
-
An FPTAS for scheduling a two-machine flowshop with one unavailability interval
-
Ng CT and Kovalyov MY (2004). An FPTAS for scheduling a two-machine flowshop with one unavailability interval. Nav Res Logist 51: 307-315.
-
(2004)
Nav Res Logist
, vol.51
, pp. 307-315
-
-
Ng, C.T.1
Kovalyov, M.Y.2
-
152
-
-
64749099690
-
A sequential method for discrete optimization problems and its application to the assignment, travelling salesman, and three machine scheduling problems
-
Nicholson TAJ (1967). A sequential method for discrete optimization problems and its application to the assignment, travelling salesman, and three machine scheduling problems. J Inst Math Appl 3: 362-375.
-
(1967)
J Inst Math Appl
, vol.3
, pp. 362-375
-
-
Nicholson, T.A.J.1
-
153
-
-
5244278595
-
A fast taboo search algorithm for the job shop problem
-
Nowicki E and Smutnicki C (1996). A fast taboo search algorithm for the job shop problem. Mngt Sci 42: 797-813.
-
(1996)
Mngt Sci
, vol.42
, pp. 797-813
-
-
Nowicki, E.1
Smutnicki, C.2
-
154
-
-
0001204823
-
A last tabu search, algorithm for the permutation flow-shop problem
-
Nowicki E and Smutnicki. C (1996). A last tabu search, algorithm for the permutation flow-shop problem. Eur J Opl Res 91: 160-175.
-
(1996)
Eur J Opl Res
, vol.91
, pp. 160-175
-
-
Nowicki, E.1
Smutnicki, C.2
-
156
-
-
38249025037
-
Simulated annealing for permutation flow-shop scheduling
-
Osman IH and Potts CN (1989). Simulated annealing for permutation flow-shop scheduling. Omega 17: 551-557.
-
(1989)
Omega
, vol.17
, pp. 551-557
-
-
Osman, I.H.1
Potts, C.N.2
-
157
-
-
0002931406
-
On the symmetric travelling salesman problem: A computational study
-
Padberg MW and Hong S (1980). On the symmetric travelling salesman problem: A computational study. Math Progr Study 12: 78-107.
-
(1980)
Math Progr Study
, vol.12
, pp. 78-107
-
-
Padberg, M.W.1
Hong, S.2
-
158
-
-
0009395081
-
Ein Beitrag zum Reihenfolge problem.
-
Piehler J (1960). Ein Beitrag zum Reihenfolge problem. Unternehmensforschung 4: 138-142.
-
(1960)
Unternehmensforschung
, vol.4
, pp. 138-142
-
-
Piehler, J.1
-
160
-
-
0008824985
-
Stochastic shop scheduling: A survey
-
Dempster MAH, Lenstra JK and Rinnooy Kan AHG eds, Riedel: Dordrecht, pp
-
Pinedo M and Schrage L (1982). Stochastic shop scheduling: A survey. In: Dempster MAH, Lenstra JK and Rinnooy Kan AHG (eds). Deterministic and Stochastic Scheduling. Riedel: Dordrecht, pp 181-196.
-
(1982)
Deterministic and Stochastic Scheduling
, pp. 181-196
-
-
Pinedo, M.1
Schrage, L.2
-
162
-
-
0019038346
-
An adaptive branching rule for the permutation flow-shop problem
-
Potts CN (1980). An adaptive branching rule for the permutation flow-shop problem. Eur J Opl Res 5: 19-25.
-
(1980)
Eur J Opl Res
, vol.5
, pp. 19-25
-
-
Potts, C.N.1
-
163
-
-
0020709337
-
Analysis of a linear programming heuristic for scheduling unrelated parallel machines
-
Potts CN (1985). Analysis of a linear programming heuristic for scheduling unrelated parallel machines. Disc Appl Math 10: 155-164.
-
(1985)
Disc Appl Math
, vol.10
, pp. 155-164
-
-
Potts, C.N.1
-
164
-
-
0033895628
-
Scheduling with batching: A review
-
Potts CN and Kovalyov MY (2000). Scheduling with batching: A review. Eur J Opl Res 120: 228-249.
-
(2000)
Eur J Opl Res
, vol.120
, pp. 228-249
-
-
Potts, C.N.1
Kovalyov, M.Y.2
-
165
-
-
0020205577
-
A decomposition algorithm for the single machine total tardiness problem
-
Potts CN and Van Wassenhove LN (1982). A decomposition algorithm for the single machine total tardiness problem. Opns Res Lett 1: 177-181.
-
(1982)
Opns Res Lett
, vol.1
, pp. 177-181
-
-
Potts, C.N.1
Van Wassenhove, L.N.2
-
166
-
-
0020735486
-
An algorithm for single machine sequencing with, deadlines to minimize total weighted completion time
-
Potts CN and Van Wassenhove LN (1983). An algorithm for single machine sequencing with, deadlines to minimize total weighted completion time. Eur J Opl Res 12: 379-387.
-
(1983)
Eur J Opl Res
, vol.12
, pp. 379-387
-
-
Potts, C.N.1
Van Wassenhove, L.N.2
-
167
-
-
0022023671
-
A branch and bound algorithm for the total weighted tatrdiness problem
-
Potts CN and Van Wassenhove LN (1985). A branch and bound algorithm for the total weighted tatrdiness problem. Opns Res 33: 363-377.
-
(1985)
Opns Res
, vol.33
, pp. 363-377
-
-
Potts, C.N.1
Van Wassenhove, L.N.2
-
168
-
-
84912978525
-
Single machine tardiness sequencing heuristics
-
Potts CN and Van Wassenhove LN (1991). Single machine tardiness sequencing heuristics. IIE Trans 23: 346-354.
-
(1991)
IIE Trans
, vol.23
, pp. 346-354
-
-
Potts, C.N.1
Van Wassenhove, L.N.2
-
169
-
-
84974861854
-
Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity
-
Potts CN and Van Wassenhove LN (1992). Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity. J Opl Res Soc 43: 395-406.
-
(1992)
J Opl Res Soc
, vol.43
, pp. 395-406
-
-
Potts, C.N.1
Van Wassenhove, L.N.2
-
170
-
-
0345861143
-
Scheduling batches with simultaneous job processing for two-machine shop problems
-
Potts CN, Strusevich VA and Tautenhahn T (2001). Scheduling batches with simultaneous job processing for two-machine shop problems. J Schedul 4: 25-51.
-
(2001)
J Schedul
, vol.4
, pp. 25-51
-
-
Potts, C.N.1
Strusevich, V.A.2
Tautenhahn, T.3
-
171
-
-
85035344127
-
Online scheduling
-
Leung JY-T ed, Chapman & Hall/CRC: Boca Raton, FL, pp
-
Pruhs K, Sgall J and Torng E (2004). Online scheduling. In: Leung JY-T (ed). Handbook of Scheduling: Algorithms, Models and Performance Analysis. Chapman & Hall/CRC: Boca Raton, FL, pp 15-1-15-43.
-
(2004)
Handbook of Scheduling: Algorithms, Models and Performance Analysis
-
-
Pruhs, K.1
Sgall, J.2
Torng, E.3
-
172
-
-
0041456171
-
Single machine scheduling polyhedra with precedence constraints
-
Queyranne M and Wang Y (1991). Single machine scheduling polyhedra with precedence constraints. Math Opns Res 16: 1-20.
-
(1991)
Math Opns Res
, vol.16
, pp. 1-20
-
-
Queyranne, M.1
Wang, Y.2
-
173
-
-
0029224965
-
A genetic algorithm for flowshop sequencing
-
Reeves CR (1995). A genetic algorithm for flowshop sequencing. Comput Opns Res 22: 5-13.
-
(1995)
Comput Opns Res
, vol.22
, pp. 5-13
-
-
Reeves, C.R.1
-
174
-
-
0033449927
-
Landscapes, operators and heuristic search
-
Reeves CR (1999). Landscapes, operators and heuristic search. Ann Opns Res 86: 473-490.
-
(1999)
Ann Opns Res
, vol.86
, pp. 473-490
-
-
Reeves, C.R.1
-
176
-
-
0001491109
-
Scheduling independent tasks on parallel processors
-
Rothkopf MH (1966). Scheduling independent tasks on parallel processors. Mngt Sci 12: 437-447.
-
(1966)
Mngt Sci
, vol.12
, pp. 437-447
-
-
Rothkopf, M.H.1
-
177
-
-
64749096435
-
-
Roy B and Sussman B (1964). Les problemes d'ordonnancement avec contraintes disjonctives. Note DS No. 9 bis, SEMA, Montrouge.
-
Roy B and Sussman B (1964). Les problemes d'ordonnancement avec contraintes disjonctives. Note DS No. 9 bis, SEMA, Montrouge.
-
-
-
-
178
-
-
0016883405
-
Algorithms for scheduling independent tasks
-
Sahni S (1976). Algorithms for scheduling independent tasks. JAssoc Comput Mach 23: 116-127.
-
(1976)
JAssoc Comput Mach
, vol.23
, pp. 116-127
-
-
Sahni, S.1
-
179
-
-
0032362468
-
Machine scheduling with availability constraints
-
Sanlaville E and Schmidt G (1998). Machine scheduling with availability constraints. Acta Informat 5: 795-811.
-
(1998)
Acta Informat
, vol.5
, pp. 795-811
-
-
Sanlaville, E.1
Schmidt, G.2
-
180
-
-
0343963100
-
Scheduling with limited machine availability
-
Schmidt G (2000). Scheduling with limited machine availability. Eur J Opl Res 121: 1-15.
-
(2000)
Eur J Opl Res
, vol.121
, pp. 1-15
-
-
Schmidt, G.1
-
181
-
-
0000891048
-
A proof of the shortest remaining processing time processing discipline
-
Schrage L (1968). A proof of the shortest remaining processing time processing discipline. Opns Res 16: 687-690.
-
(1968)
Opns Res
, vol.16
, pp. 687-690
-
-
Schrage, L.1
-
182
-
-
0000478729
-
Solving resource-constrained network problems by implicit enumeration-Nonpreemptive case
-
Schrage L (1970a). Solving resource-constrained network problems by implicit enumeration-Nonpreemptive case. Opns Res 18: 253-278.
-
(1970)
Opns Res
, vol.18
, pp. 253-278
-
-
Schrage, L.1
-
183
-
-
64749105034
-
A bound, based on the equivalence of minmax-completion time and min-max-lateness scheduling objectives
-
Report 7042, Department of Economics and Graduate School of Business, Chicago, IL
-
Schrage L (1970b). A bound, based on the equivalence of minmax-completion time and min-max-lateness scheduling objectives. Report 7042, Department of Economics and Graduate School of Business, Chicago, IL.
-
(1970)
-
-
Schrage, L.1
-
184
-
-
84947263086
-
Performance guarantees of local search for multiprocessor scheduling
-
Aardal KI and Gerards AMH Eds, Integer Programming and Combinatorial Optimization, Springer: Berlin, pp
-
Schuurman P and Vredeveld T (2001). Performance guarantees of local search for multiprocessor scheduling. In: Aardal KI and Gerards AMH (Eds). Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, Vol. 2081. Springer: Berlin, pp 370-382.
-
(2001)
Lecture Notes in Computer Science
, vol.2081
, pp. 370-382
-
-
Schuurman, P.1
Vredeveld, T.2
-
185
-
-
0042983554
-
Polynomial time approximation algorithms for machine scheduling: Ten open problems
-
Schuurman P and Woeginger GJ (1999). Polynomial time approximation algorithms for machine scheduling: Ten open problems. J Schedul 2: 203-213.
-
(1999)
J Schedul
, vol.2
, pp. 203-213
-
-
Schuurman, P.1
Woeginger, G.J.2
-
186
-
-
0002595962
-
On some geometric methods in scheduling theory: A survey
-
Sevastianov SV (1994). On some geometric methods in scheduling theory: A survey. Disc Appl Math 55: 59-82.
-
(1994)
Disc Appl Math
, vol.55
, pp. 59-82
-
-
Sevastianov, S.V.1
-
187
-
-
0029241717
-
Vector summation in Banach space and polynomial algorithms for flow shops and open shops
-
Sevastianov SV (1995). Vector summation in Banach space and polynomial algorithms for flow shops and open shops. Math Opns Res 20: 90-103.
-
(1995)
Math Opns Res
, vol.20
, pp. 90-103
-
-
Sevastianov, S.V.1
-
188
-
-
0001353081
-
Makespan minimization in open shops: A polynomial time approximation scheme
-
Sevastianov SV and Woeginger GJ (1998). Makespan minimization in open shops: A polynomial time approximation scheme. Math Progr B 82: 191-198.
-
(1998)
Math Progr B
, vol.82
, pp. 191-198
-
-
Sevastianov, S.V.1
Woeginger, G.J.2
-
189
-
-
0000483285
-
On the N-job one-machine, sequence-independent scheduling problem with tardiness penalties: A branch-bound solution
-
Shwimer J (1972). On the N-job one-machine, sequence-independent scheduling problem with tardiness penalties: A branch-bound solution. Mngt Sci 18: B301-B313.
-
(1972)
Mngt Sci
, vol.18
-
-
Shwimer, J.1
-
190
-
-
24944471741
-
Complexity of preemptive minsum scheduling on unrelated parallel machines
-
Sitters RA (2005). Complexity of preemptive minsum scheduling on unrelated parallel machines. J Algorithms 57: 37-48.
-
(2005)
J Algorithms
, vol.57
, pp. 37-48
-
-
Sitters, R.A.1
-
191
-
-
0000093702
-
Convex quadratic and semidefinite programming relaxations in scheduling
-
Mach
-
Skutella M (2001). Convex quadratic and semidefinite programming relaxations in scheduling. J Assoc Comput Mach 48: 206-242.
-
(2001)
J Assoc Comput
, vol.48
, pp. 206-242
-
-
Skutella, M.1
-
192
-
-
0002066821
-
Various optimizers for single-stage production
-
Smith WE (1956). Various optimizers for single-stage production. Nav Res Logist Quart 3: 59-66.
-
(1956)
Nav Res Logist Quart
, vol.3
, pp. 59-66
-
-
Smith, W.E.1
-
193
-
-
0026641854
-
Experiment on using genetic algorithms to learn scheduling heuristics
-
ed, The International Society for Optical Engineering: Bellingham, WA, pp
-
Smith SP (1992). Experiment on using genetic algorithms to learn scheduling heuristics. In: Biswas G (ed). Proceedings of SPIE, Volume 1707, Applications of Artificial Intelligence X: Knowledge-Based Systems, The International Society for Optical Engineering: Bellingham, WA, pp 378-386.
-
(1992)
Proceedings of SPIE, Volume 1707, Applications of Artificial Intelligence X: Knowledge-Based Systems
, pp. 378-386
-
-
Smith, S.P.1
-
195
-
-
0026930899
-
New search spaces for sequencing problems with application to job shop scheduling
-
Storer RH, Wu SD and Vaccari R (1992). New search spaces for sequencing problems with application to job shop scheduling. Mngt Sci 38: 1495-1509.
-
(1992)
Mngt Sci
, vol.38
, pp. 1495-1509
-
-
Storer, R.H.1
Wu, S.D.2
Vaccari, R.3
-
196
-
-
0033743394
-
Group technology approach to the open shop scheduling problem with batch setup times
-
Strusevich VA (2000). Group technology approach to the open shop scheduling problem with batch setup times. Opns Res Lett 26: 181-192.
-
(2000)
Opns Res Lett
, vol.26
, pp. 181-192
-
-
Strusevich, V.A.1
-
197
-
-
0005025354
-
A simple optimality proof of Moore's sequencing algorithm
-
Sturm LBJM (1970). A simple optimality proof of Moore's sequencing algorithm. Mngt Sci 17: 116-118.
-
(1970)
Mngt Sci
, vol.17
, pp. 116-118
-
-
Sturm, L.B.J.M.1
-
198
-
-
26444476435
-
On some sequencing problems
-
Szwarc W (1968). On some sequencing problems. Nav Res Logist Quart 15: 127-155.
-
(1968)
Nav Res Logist Quart
, vol.15
, pp. 127-155
-
-
Szwarc, W.1
-
199
-
-
0040376238
-
Elimination methods in the m n sequencing problem
-
Szwarc W (1971). Elimination methods in the m « n sequencing problem. Nav Res Logist Quart 18: 295-305.
-
(1971)
Nav Res Logist Quart
, vol.18
, pp. 295-305
-
-
Szwarc, W.1
-
200
-
-
0005771451
-
Optimal elimination methods in the m n sequencing problem
-
Szwarc W (1973). Optimal elimination methods in the m « n sequencing problem. Opns Res 21: 1250-1259.
-
(1973)
Opns Res
, vol.21
, pp. 1250-1259
-
-
Szwarc, W.1
-
201
-
-
0025700701
-
-
1.990, Some efficient heuristic methods for the flow shop sequencing problem
-
Taillard E (1.990). Some efficient heuristic methods for the flow shop sequencing problem. Eur J Opl Res 47: 65-74.
-
Eur J Opl Res
, vol.47
, pp. 65-74
-
-
Taillard, E.1
-
202
-
-
0000892122
-
Parallel taboo search, techniques for the job shop scheduling problem
-
Taillard E (1994). Parallel taboo search, techniques for the job shop scheduling problem. ORSA J Comput 6: 108-117.
-
(1994)
ORSA J Comput
, vol.6
, pp. 108-117
-
-
Taillard, E.1
-
207
-
-
0024700013
-
A new heuristic method for the flow shop sequencing problem
-
Widmer M and Hertz A (1989). A new heuristic method for the flow shop sequencing problem. Eur J Opl Res 41: 186-193.
-
(1989)
Eur J Opl Res
, vol.41
, pp. 186-193
-
-
Widmer, M.1
Hertz, A.2
-
208
-
-
0015128399
-
An improved method for scheduling independent tasks
-
Wilkerson L and Irwin J (1971). An improved method for scheduling independent tasks. AIIE Trans 33: 239-245.
-
(1971)
AIIE Trans
, vol.33
, pp. 239-245
-
-
Wilkerson, L.1
Irwin, J.2
-
209
-
-
0031100831
-
Short shop schedules
-
Williamson DP, Hall LA, Hoogeveen JA, Hurkens CAJ, Lenstra JK, Sevastianov SV and Shmoys DB (1997). Short shop schedules. Opns Res 45: 288-294.
-
(1997)
Opns Res
, vol.45
, pp. 288-294
-
-
Williamson, D.P.1
Hall, L.A.2
Hoogeveen, J.A.3
Hurkens, C.A.J.4
Lenstra, J.K.5
Sevastianov, S.V.6
Shmoys, D.B.7
-
210
-
-
0000086539
-
A genetic algorithm applicable to large-scale job-shop problems
-
Männer R and Manderick B eds, North Holland: Amsterdam, pp
-
Yamada T and Nakano R (1992). A genetic algorithm applicable to large-scale job-shop problems. In: Männer R and Manderick B (eds). Parallel Problem Solving from Nature 2. North Holland: Amsterdam, pp 281-290.
-
(1992)
Parallel Problem Solving from Nature 2
, pp. 281-290
-
-
Yamada, T.1
Nakano, R.2
-
211
-
-
0028699153
-
A simulated annealing approach to job shop scheduling using critical block, transition operators
-
IEEE: New York, pp
-
Yamada T, Rosen BE and Nakano R (1994). A simulated annealing approach to job shop scheduling using critical block, transition operators. Proceedings of the IEEE International Conference on Neural Networks, ICNN'94. IEEE: New York, pp 4687-4692.
-
(1994)
Proceedings of the IEEE International Conference on Neural Networks, ICNN'94
, pp. 4687-4692
-
-
Yamada, T.1
Rosen, B.E.2
Nakano, R.3
|