-
2
-
-
32944480177
-
Job-shop scheduling with limited capacity buffers
-
January
-
P. Brucker, S. Heitmann, J.L. Hurink, and T. Nieberg. Job-shop scheduling with limited capacity buffers. OR Spectrum, 28(2):151-176, January 2006.
-
(2006)
OR Spectrum
, vol.28
, Issue.2
, pp. 151-176
-
-
Brucker, P.1
Heitmann, S.2
Hurink, J.L.3
Nieberg, T.4
-
3
-
-
80655146409
-
Dedicated constraint propagation for job-shop problem with generic time-lags
-
2011 IEEE 16th Conference on sept.
-
P. Lacomme, N. Tchernev, and M.J. Huguet. Dedicated constraint propagation for job-shop problem with generic time-lags. In Emerging Technologies Factory Automation (ETFA), 2011 IEEE 16th Conference on, pages 1-7, sept. 2011.
-
(2011)
Emerging Technologies Factory Automation (ETFA)
, pp. 1-7
-
-
Lacomme, P.1
Tchernev, N.2
Huguet, M.J.3
-
4
-
-
0000541519
-
Machine scheduling with an availability constraint
-
Chung-Yee Lee. Machine scheduling with an availability constraint. Journal of Global Optimization, 9:395-416, 1996.
-
(1996)
Journal of Global Optimization
, vol.9
, pp. 395-416
-
-
Lee, C.-Y.1
-
5
-
-
0037146442
-
Linguistic-based meta-heuristic optimization model for flexible job shop scheduling
-
A. Baykasoglu. Linguistic-based meta-heuristic optimization model for flexible job shop scheduling. International Journal of Production Research, 40(17):4523-4543, 2002.
-
(2002)
International Journal of Production Research
, vol.40
, Issue.17
, pp. 4523-4543
-
-
Baykasoglu, A.1
-
6
-
-
34250084648
-
Routing and scheduling in a flexible job shop by tabu search
-
10.1007/BF02023073
-
P Brandimarte. Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research, 41:157-183, 1993. 10.1007/BF02023073.
-
(1993)
Annals of Operations Research
, vol.41
, pp. 157-183
-
-
Brandimarte, P.1
-
7
-
-
0035719796
-
An integrated greedy heuristic for a flexible job shop scheduling problem
-
2001 IEEE International Conference on Vol.4
-
Y. Mati, N. Rezg, and Xiaolan Xie. An integrated greedy heuristic for a flexible job shop scheduling problem. In Systems, Man, and Cybernetics, 2001 IEEE International Conference on, volume 4, pages 2534-2539 vol.4, 2001.
-
(2001)
Systems, Man, and Cybernetics
, vol.4
, pp. 2534-2539
-
-
Mati, Y.1
Rezg, N.2
Xie, X.3
-
9
-
-
34547651088
-
Mathematical modeling and heuristic approaches to flexible job shop scheduling problems
-
P. Fattahi, M.S. Mehrabad, and F. Jolai. Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. Journal of Intelligent Manufacturing, 18:331-342, 2007.
-
(2007)
Journal of Intelligent Manufacturing
, vol.18
, pp. 331-342
-
-
Fattahi, P.1
Mehrabad, M.S.2
Jolai, F.3
-
10
-
-
75449102375
-
Mathematical models for job-shop scheduling problems with routing and process plan flexibility
-
Cemal 'Mathematical models for job-shop scheduling problems with routing and process plan flexibility. Applied Mathematical Modelling, 34(6):1539 - 1548, 2010.
-
(2010)
Applied Mathematical Modelling
, vol.34
, Issue.6
, pp. 1539-1548
-
-
Cemal1
-
11
-
-
77957766559
-
Sequence planning for integrated product, process and automation design
-
IEEE Transactions on oct.
-
B. Lennartson, K. Bengtsson, Chengyin Yuan, K. Andersson, M. Fabian, P. Falkman, and K. Akesson. Sequence planning for integrated product, process and automation design. Automation Science and Engineering, IEEE Transactions on, 7(4):791-802, oct. 2010.
-
(2010)
Automation Science and Engineering
, vol.7
, Issue.4
, pp. 791-802
-
-
Lennartson, B.1
Bengtsson, K.2
Yuan, C.3
Andersson, K.4
Fabian, M.5
Falkman, P.6
Akesson, K.7
-
12
-
-
0019585243
-
A review of production scheduling
-
S.C. Graves. A review of production scheduling. Operations Research, 29(4), 1981.
-
(1981)
Operations Research
, vol.29
, Issue.4
-
-
Graves, S.C.1
-
13
-
-
17444396374
-
An advanced tabu search algorithm for the job shop problem
-
N. Eugeniusz and S. Czeslaw. An advanced tabu search algorithm for the job shop problem. Journal of Scheduling, 8:145-159, 2005.
-
(2005)
Journal of Scheduling
, vol.8
, pp. 145-159
-
-
Eugeniusz, N.1
Czeslaw, S.2
-
15
-
-
70350407146
-
Closing the open shop: Contradicting conventional wisdom
-
D. Grimes, E. Hebrard, and A. Malapert. Closing the open shop: Contradicting conventional wisdom. In CP'09, pages 400-408, 2009.
-
(2009)
CP'09
, pp. 400-408
-
-
Grimes, D.1
Hebrard, E.2
Malapert, A.3
-
18
-
-
0002869954
-
Extending chip in order to solve complex scheduling and placement problems
-
A. Aggoun and N. Beldiceanu. Extending chip in order to solve complex scheduling and placement problems. Mathematical and Computer Modelling, 17(7):57 - 73, 1993.
-
(1993)
Mathematical and Computer Modelling
, vol.17
, Issue.7
, pp. 57-73
-
-
Aggoun, A.1
Beldiceanu, N.2
-
22
-
-
0000237789
-
On the job-shop scheduling problem
-
Alan S. Manne. On the job-shop scheduling problem. Operations Research, 8(2):pp. 219-223, 1960.
-
(1960)
Operations Research
, vol.8
, Issue.2
, pp. 219-223
-
-
Manne, A.S.1
-
23
-
-
0000518993
-
An integer linear-programming model for machine scheduling
-
H.M. Wagner. An integer linear-programming model for machine scheduling. Naval Research Logistics Quarterly, 6(2):131-140, 1959.
-
(1959)
Naval Research Logistics Quarterly
, vol.6
, Issue.2
, pp. 131-140
-
-
Wagner, H.M.1
-
24
-
-
0038709760
-
The schedule-sequencing problem
-
E.H. Bowman. The schedule-sequencing problem. Operations Research, 7(5):pp. 621-624, 1959.
-
(1959)
Operations Research
, vol.7
, Issue.5
, pp. 621-624
-
-
Bowman, E.H.1
|