1 |
Azizoglu, M., Cakmak, E. and Kondakci, S. A. (2001), A flexible flow shop problem with total flow time minimization, European Journal of Operational Research, 132, 528-538
DOI
ScienceOn
|
2 |
Chen, B. (1995), Analysis of classes of heuristics for scheduling a two-stage flow shop with parallel machines at on stage, Journal of Operation Research Society, 46, 231-244
|
3 |
Garey, M. R. and Johnson, D. S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company
|
4 |
Glover, F. (1989), Tabu search: part I, ORSA Journal of Computing, 1, 190-206
DOI
|
5 |
Park, M.-W. and Kim, Y.-D. (1998), A systematic procedure for setting parameters in simulated annealing algorithms, Computers and Operations Research, 25, 207-217
DOI
ScienceOn
|
6 |
Lee, J. S. and Park, S. H. (1999), Scheduling heuristics for a two-stage hybrid flowshop with nonidentical parallel machines, Journal of the Korean Institute of Industrial Engineers, 25, 254-265
|
7 |
Lee, G.-C. (2006), Scheduling methods for a hybrid flowshop with dynamic order arrival, Journal of the Korean Institute of Industrial Engineers, 32, 373-381
|
8 |
Choi, H.-S. and Lee, D.-H. (2009), Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops, Computers and Industrial Engineering, 56, 113-120
DOI
ScienceOn
|
9 |
Lee, C. Y. and Vairaktarakis, G. L. (1994), Minimizing makespan in hybrid flow shops, Operations Research Letters, 16, 149-158
DOI
ScienceOn
|
10 |
Lee, G.-C., Kim, Y.-D. and Choi, S.-W. (2004), Bottleneck-focused scheduling for a hybrid flow shop, International Journal of Production Research, 42, 165-181
DOI
ScienceOn
|
11 |
Glover, F., Laguna, M. (1993), Tabu search in Modern Heuristics Techniques for Combinatorial Problems, Blackwell Scientific Publications, Oxford, 70-141
|
12 |
Gupta, J. N. D. and Tunc, E. A. (1998), Minimizing tardy jobs in a two-stage hybrid flowshop, International Journal of Production Research, 36, 2397-2417
DOI
ScienceOn
|
13 |
Choi, H.-S. and Lee, D.-H. (2007), A branch and bound algorithm for two-stage hybrid flow shops: minimizing the number of tardy jobs, Journal of the Korean Institute of Industrial Engineers, 33, 213-220
|
14 |
Choi, H.-S., Kim, H.-W., Lee, D.-H., Yun, J., Yoon, C. Y., and Chae, K. B. (2009), Scheduling algorithms for two-stage reentrant hybrid flow shops: minimizing makespan under the maximum allowable due-dates, International Journal of Advanced Manufacturing Technology, 42, 963-973
DOI
ScienceOn
|
15 |
Laguna, M., Barnes, J. W. and Glover, F. (1991), Tabu search methods for a single machine scheduling problem, Journal of Intelligent Manufacturing, 2, 63-74
DOI
|
16 |
Lee, G.-C. and Kim, Y.-D. (2004), A branch-and-bound algorithm for a two-stage hybrid flow shop scheduling problem minimizing total tardiness, International Journal of Production Research, 42, 4731-4743
DOI
ScienceOn
|
17 |
Tsubone, H., Ohba, M., and Uetake, T. (1996), The impact of lot sizing and sequencing on manufacturing performance in a two-stage hybrid flow shop, International Journal of Production Research, 34, 3037-3053
DOI
ScienceOn
|
18 |
Kemal, A., Orhan, E. and Alper, D. (2007), Using ant colony optimization to solve hybrid flow shop scheduling problems, International Journal of Advanced Manufacturing Technology, 35, 541-550
DOI
ScienceOn
|
19 |
Kim, S.-I., Choi, H,-S. and Lee, D.-H. (2007), Scheduling algorithms for parallel machines with sequence-dependent setup and distinct ready times: minimizing total tardiness, Proceedings of the Institution of Mechanical Engineers Part B: Journal of Engineering Manufacture, 221, 1087-1096
DOI
ScienceOn
|
20 |
Linn, R. and Zhang, W. (1999), Hybrid flow shop scheduling, Computers and Industrial Engineering, 37, 57-61
DOI
ScienceOn
|
21 |
Fouad, R., Abdelhakim, A. and Salah, E. E. (1998), A hybrid three-stage flowshop problem: efficient heuristics to minimize makespan, European Journal of Operational Research, 109, 321-329
DOI
ScienceOn
|
22 |
Brah, S. A. and Hunsucker J. L. (1991), Branch and bound algorithm for the flow shop with multiple processors, European Journal of Operational Research, 51, 88-99
DOI
ScienceOn
|
23 |
Ho, J. C. and Chang, Y. L. (1995), Minimizing the number of tardy jobs for m parallel machines, European Journal of Operational Research, 84, 343-355
DOI
ScienceOn
|
24 |
Janiak, A., Kozan, E., Lichtenstein, M. and Oguz, C. (2007), Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion, International Journal of Production Economics, 105, 407-424
DOI
ScienceOn
|
25 |
Guinet, A. G. P. and Solomon, M. M. (1996), Scheduling hybrid flow shops to minimize maximum tardiness or maximum completion time, International Journal of Production Research, 34, 1643-1654
DOI
ScienceOn
|
26 |
Gupta, J. N. D. (1988), Two-stage hybrid flow shop scheduling problem, Journal of Operation Research Society, 39, 359-364
DOI
|
27 |
Gupta, J. N. D. and Tunc, E. A. (1991), Scheduling for a two-stage hybrid flowshop with parallel machines at the second stage, International Journal of Production Research, 29, 1480-1502
|
28 |
Mourisli, O. and Pochet, Y. (2000), A branch-and-bound algorithm for the hybrid flow shop, International Journal of Production Research Economics, 64, 113-125
DOI
ScienceOn
|