1 |
Brah, S. A. and Hunsucker, J. L. (1991), Branch and bound algorithm for a flowshop within multiple processors, European Journal of Operational Research, 51, 88-99.
DOI
|
2 |
Chen, B. (1995), Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage, Journal of the Operational Research Society, 46, 23-244.
|
3 |
Cheng, T. C. E., Kovalyov, M. Y., and Chakhlevich, K. N. (2012) Batching in a two-stage flowshop with dedicated machines in the second stage, IIE Transactions, 36, 87-93.
|
4 |
Deal, D. E. and Hunsucker, J. L. (1991), The two-stage flowshop scheduling problem with M machines at each stage, Journal of Information and Optimization Sciences, 12, 407-417.
DOI
|
5 |
Graham, R. L. (1969), Bounds on Multiprocessing Timing Anomalies, SIAM J. Appl. Math., 17, 416-429.
DOI
|
6 |
Graham, R. L., Lawler, E. L., Lenstra, J. K., and Rinnooy, Kan A. H. G. (1979), Optimization and approximation in deterministic sequencing and scheduling: a survey, Annals of Discrete Mathematics, 5, 287-326.
DOI
|
7 |
Gupta, J. N. D. (1988), Two-stage, hybrid flowshop scheduling problem, Journal of the Operational Research Society, 39, 359-364.
DOI
|
8 |
Gupta, J. N. D., Hairi, A. M. A., and Potts, C. N. (1997), Scheduling a two-stage hybrid flow shop with parallel machines at the first stage, Annals of Operations Research, 69, 171-191.
DOI
|
9 |
Gupta, J. N. D. and Tunc, E. A. (1991), Schedules for a two-stage hybrid flowshop with parallel machines at the second stage, International Journal of Production Research, 29, 1489-1502.
DOI
|
10 |
Hoogeveen, J. A., Lenstra, J. K., and Veltman, B. (1996), Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard, European Journal of Operational Research, 89, 172-175.
DOI
|
11 |
Hunsucker, J. L. and Shah, J. R. (1992), Performance of priority rules in a due date flowshop, OMEGA, 20, 73-89.
DOI
|
12 |
Johnson, S. M. (1954), Optimal Two- and Three-Stage Production with Setup Times Included, Naval Research Quarterly, 61-68.
|
13 |
Lee, C.-Y. and Variaktarakis, G. L. (1994), Minimizing makespan in hybrid flowshops, Operation Research Letters, 16, 149-159.
DOI
|
14 |
Lin, H.-T. and Liao, C.-J. (2003), A case study in a twostage hybrid flow shop with setup time and dedicated machines, International Journal of Production Economics, 86, 133-143.
DOI
|
15 |
Rajendran, C. and Chaudhari, D. (1992), Scheduling in n-job, m-stage flowshop with parallel processors to minimize makespan, International Journal of Production Economics, 27, 137-143.
DOI
|
16 |
Riane, F., Artiba, A., and Elmaghraby, S. E. (2002), Sequencing a hybrid two-stage flowshop with dedicated machines, International Journal of Production Research, 40, 4353-4380.
DOI
|
17 |
Ribas, I., Leisten, R., and Framinan, J. M. (2010), Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective, Computers and Operations Research, 37, 1439-1454.
DOI
|
18 |
Ruiz, R. and Vazguez-Rodriguez., J. A. (2010), The hybrid flow shop scheduling problem, European Journal of Operational Research, 205, 1-18.
DOI
ScienceOn
|
19 |
Wang, S. and Liu, M. (2013), A heuristic method for two-stage hybrid flow shop with dedicated machines, Computers and Operations Research, 40, 438-450.
DOI
|
20 |
Yang, J. (2010), A new complexity for the two-stage hybrid flow shop scheduling problem with dedicated machines, International Journal of Production Research, 48, 1531-1538.
DOI
|
21 |
Yang, J. (2013), A two-stage hybrid flow shop with dedicated machines at the first stage, Computers and Operations Research, 40, 2836-2843.
DOI
|
22 |
Zijm, W. H. M. and Nelissen, E. H. L. B. (1990), Scheduling a flexible machining centre, Engineering Costs and Production Economics, 19, 249-258.
DOI
|