| 1 |
Balas, E. (1969), Machine sequencing via disjunctive graphs: an implicit enumeration approach, Operations Research, 17, 941-957.
DOI
ScienceOn
|
| 2 |
Kagr, L. L. and Thompson, G. L. (1964), A heuristic approach to the traveling salesman, Management Science, 11, 225-248.
|
| 3 |
Artigues, C. and Roubellat, F. (2002), An efficient algorithm for operation insertion in a multi-resource jobshop schedule with sequence-dependent setup times, Production Planning and Control, 13, 175-186.
DOI
ScienceOn
|
| 4 |
Asano, M. and Ohta, H. (1999), Scheduling with shutdowns and sequence dependent set-up times, International Journal of Production Research, 37, 1661- 1676.
DOI
ScienceOn
|
| 5 |
Uzsoy, R. and Wang, C. S. (2000), Performance of decomposition procedures for job shop scheduling problems with bottleneck machines, International Journal of Production Research, 38, 1271-1286.
DOI
ScienceOn
|
| 6 |
Ovacik, I. M. and Uzsoy, R. (1995), Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times, International Journal of Production Research, 33, 3173-3192
DOI
ScienceOn
|
| 7 |
Radhakrishnan, S. and Ventura, J. A. (2000), Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times, International Journal of Production Research, 38, 2233-2252.
DOI
ScienceOn
|
| 8 |
Blanco, L., Dell'olmo, P., and Giordani, S. (1999), Flow shop no-wait scheduling with sequence dependent set-up times and release dates, INFOR Journal, 37, 3-11.
|
| 9 |
Zhu, X. and Wilhelm, W. (2006), Scheduling and lot sizing with sequence-dependent setup: A literature review. IIE Transactions, 38, 987-1007.
DOI
ScienceOn
|
| 10 |
Chu, C., Proth, J. M., and Wang, C. (1998), Improving job-shop schedules through critical pairwise exchanges, International Journal of Production Research, 36, 683-694.
DOI
ScienceOn
|
| 11 |
Wilbrecht, J. K. and Prescott, E. (1969), The influence of set-up time on job shop performance, Management Science, 16, 274-280.
DOI
|
| 12 |
Gupta, J. N. D. (1986), The two machine sequence dependent flow shop scheduling problem, European Journal of Operations Research, 24, 439-446.
DOI
ScienceOn
|
| 13 |
Sun, X., Noble, J. S., and Klein, C. M. (1999), Singlemachine scheduling with sequence dependent setup to minimize total weighted squared tardiness, IIE Transactions, 31, 113-124.
|
| 14 |
Balas, E., Lenstra, J. K., and Vazacopoulos, E. (1995), The one machine problem with delayed precedence constraints and its use in job shop scheduling, Management Science, 41, 94-109.
DOI
ScienceOn
|
| 15 |
Norman, B. A. (1999), Scheduling flowshops with finite buffers and sequence-dependent setup times, Computers and Industrial Engineering, 36, 163-177.
DOI
ScienceOn
|
| 16 |
Flynn, B. B. (1987), Repetitive lots: the use of a sequence-dependent set-up time scheduling procedure in group technology and traditional shops, Journal of Operations Management, 7, 203-216.
DOI
ScienceOn
|
| 17 |
Gupta, J. N. D. (2002), An excursion in scheduling theory: an overview of scheduling research in the twentieth century, Production Planning and Control, 13, 105- 116.
DOI
ScienceOn
|
| 18 |
Ovacik, I. M. and Uzsoy, R. (1997), Decomposition Methods for Complex Factory Scheduling Problems, Norwell, MA: Kluwer Academic.
|
| 19 |
Uskup, E. and Smith, S. B. (1975), A branch-and-bound algorithm for two-stage production-sequencing problems, Operations Research, 23, 118-136.
DOI
ScienceOn
|
| 20 |
Kim, S. C. and Bobrowski, P. M. (1994), Impact of sequence- dependent setup time on job shop scheduling performance, International Journal of Production Research, 32, 1503-1520.
DOI
ScienceOn
|
| 21 |
Gupta, S. K. (1982), N jobs and m machines job-shop problems with sequence dependent setup times, International Journal of Production Research, 20, 643-656.
DOI
ScienceOn
|
| 22 |
Corwin, B. D. and Esogbue, A. O. (1974), Two machine flow shop scheduling problems with sequence dependent setup times : A dynamic programming approach, Naval Research Logistics Quarterly, 21, 515-524.
DOI
ScienceOn
|
| 23 |
Conway, R. W., Maxwell W. L., and Miller L. W. (1967), Theory of Scheduling, Addison-Wesley, Reading, MA.
|
| 24 |
Sun, J. U. and Hwang, H. (2001), Scheduling problem in a two-machine flow line with the N-step prior-jobdependent set-up times, International Journal of Systems Science, 32, 375-385.
DOI
ScienceOn
|
| 25 |
Ahn, S. H. (1995), A study on algorithm to minimize makespan of sequenc-dependent jobs, Journal of the Korean Institute of Management Science, 12, 77-87.
|
| 26 |
Adams, J., Balas, E., and Zawack, D. (1988), The shifting bottleneck procedure for job shop scheduling, Management Science, 3, 391-401.
|
| 27 |
Hwang, H. and Sun, J. U. (1998), Production sequencing problem with re-entrant work flows and sequence dependent setup times, International Journal of Production Research, 36, 2435-2450.
DOI
ScienceOn
|
| 28 |
Zoghby, J., Barnes, J. W., and Hasenbein, J. J. (2005), Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches. European Journal of Operational Research, 167, 336-348.
DOI
ScienceOn
|
webmaster
