SEARCH

SEARCH BY CITATION

References

  • 1
    J. Achugbue, F.Y. Chin, Complexity and solutions of some three-stage flow shop scheduling problems, Math Oper Res 7 ( 1982), 532544.
  • 2
    B. Adenso-Diaz, Restricted neighborhood in the tabu search for the flow shop problem, Eur J Oper Res 62 ( 1992), 2737.
  • 3
    B. Adenso-Diaz, An SA/TS mixture algorithm for the scheduling tardiness problem, Eur J Oper Res 88 ( 1996), 516524.
  • 4
    M. Akhshabi, M. Akhshabi, J. Khalatbari, Bi-criteria flow shop scheduling with fuzzy simulated annealing algorithm, Afr J Bus Manage 6 ( 2012), 74787488.
  • 5
    A. Allahverdi, T. Aldowaisan, Job lateness in flow shops with setup and removal times separated, J Oper Res Soc 49 ( 1998), 10011006.
  • 6
    A. Allahverdi, J.N.D. Gupta, A review of scheduling research involving setup considerations, Omega 27 ( 1999), 219239.
  • 7
    A. Allahverdi, J. Mittenthal, Two-machine ordered flow shop scheduling under random breakdowns, Math Comput Model 20 ( 1994), 917.
  • 8
    A. Allahverdi, J. Mittenthal, Dual criteria scheduling on a two-machine flow shop subject to random breakdowns, Int Trans Oper Res 5 ( 1998), 317324.
  • 9
    R.K. Arora, S.P. Rana, Scheduling in a semi-ordered flow shop without intermediate queues, AIIE Trans 12 ( 1980), 263272.
  • 10
    S. Axsäter, On scheduling in a semi-ordered flow shop without intermediate queues, AIIE Trans 14 ( 1982), 128130.
  • 11
    K.R. Baker, Elements of sequencing and scheduling, Private Publication, Dartmouth College, Hanover, NH, 1994.
  • 12
    K.R. Baker, D. Trietsch, Principles of sequencing and scheduling, John Wiley, New York, 2009.
  • 13
    R.E. Bellman, A.O. Esogbue, I. Nabeshima, Mathematical aspects of scheduling and applications, Pergamon Press, Oxford, England, 1982.
  • 14
    D. Biskup, A state-of-the-art review on scheduling with learning effects, Eur J Oper Res 188 ( 2008), 315329.
  • 15
    T.C.E. Cheng, N. Shakhlevich, Proportionate flow shop with controllable processing times, J Schedul 2 ( 1999), 253265.
  • 16
    F.Y. Chin, L.L. Tsai, On J-maximal and J-minimal flow shop schedules, J ACM 28 ( 1981), 462476.
  • 17
    B.C. Choi, J. Chung, Two-machine flow shop scheduling problem with an outsourcing option, Eur J Oper Res 213 ( 2011), 6672.
  • 18
    B.C. Choi, K. Lee, J.Y.T. Leung, M. Pinedo, Flow shops with machine maintenance: Ordered and proportionate cases, Eur J Oper Res 207 ( 2010), 97104.
  • 19
    B.C. Choi, J.Y.T. Leung, M. Pinedo, A note on makespan minimization in proportionate flow shops, Inform Process Lett 111 ( 2010), 7781.
  • 20
    B.C. Choi, J.Y.T. Leung, M. Pinedo, Minimizing makespan in an ordered flow shop with machine-dependent processing times, J Comb Optim 22 ( 2011), 797818.
  • 21
    B.C. Choi, S.H. Yoon, S.J. Chung, Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds, Int J Prod Res 44 ( 2006), 715728.
  • 22
    B.C. Choi, S.H. Yoon, S.J. Chung, Minimizing maximum completion time in a proportionate flow shop with one machine of different speed, Eur J Oper Res 176 ( 2007), 964974.
  • 23
    R.W. Conway, W.L. Maxwell, L.W. Miller, Theory of scheduling, Addison-Wesley Publishing Co., Reading, MA, 1967.
  • 24
    F. Della Croce, J.N.D. Gupta, R. Tadei, Minimizing tardy jobs in a flow shop with common due date, Eur J Oper Res 120 ( 2000), 375381.
  • 25
    R.A. Dudek, S.S. Panwalkar, M.L. Smith, The lessons of flow shop scheduling research, Oper Res 40 ( 1992), 713.
  • 26
    S.E. Elmaghraby, The machine sequencing problem—Review and extensions, Nav Res Log Q 15 ( 1968), 205232.
  • 27
    J.M. Framinan, J.N.D. Gupta, R. Leisten, A review and classification of heuristics for permutation flow-shop scheduling with makespan objective, J Oper Res Soc 55 ( 2004), 12431255.
  • 28
    S. French, Sequencing and scheduling: An introduction to mathematics of the job shop, John Wiley, New York, 1982.
  • 29
    M.R. Garey, D.S. Johnson, R. Sethi, Complexity of flow shop and job shop scheduling, Math Oper Res 1 ( 1976), 117129.
  • 30
    P.C. Gilmore, R.E. Gomory, Sequencing a one state-variable machine: A solvable case of the traveling salesman problem, Oper Res 12 ( 1964), 655679.
  • 31
    J.N.D. Gupta, V.R. Neppalli, F. Werner, Minimizing total flow time in a two-machine flow shop problem with minimum makespan, Int J Prod Econ 69 ( 2001), 323328.
  • 32
    J.N.D. Gupta, E.F. Stafford Jr., Flow shop scheduling research after five decades, Eur J Oper Res 169 ( 2006), 375381.
  • 33
    N.G. Hall, C. Sriskandarajah, A survey of machine scheduling problems with blocking and no-wait in process, Oper Res 44 ( 1996), 510525.
  • 34
    S.R. Hejazi, S. Saghafian, Flow shop-scheduling problems with makespan criterion: A review, Int J Prod Res 43 ( 2005), 28952929.
  • 35
    J.A. Hoogeveen, T. Kawaguchi, Minimizing total completion time in a two-machine flow shop: Analysis of special cases, Math Oper Res 24 ( 1999), 887910.
  • 36
    S. Hou, H. Hoogeveen, The three-machine proportionate flow shop problem with unequal machine speeds, Oper Res Lett 31 ( 2003), 225231.
  • 37
    A. Janiak, General flow shop scheduling with resource constraints, Int J Prod Res 26 ( 1988), 10891103.
  • 38
    S.M. Johnson, Optimal two and three stage production schedules with setup times included, Nav Res Log Q 1 ( 1954), 6168.
  • 39
    C. Koulamas, G.J. Kyparisis, Single-machine and two-machine flow shop scheduling with general learning functions, Eur J Oper Res 178 ( 2007), 402407.
  • 40
    C. Koulamas, G.J. Kyparisis, A note on the proportionate flow shop with a bottleneck machine, Eur J Oper Res 193 ( 2009), 644645.
  • 41
    D. Latorraca, The bidirectional-ordered flow shop problem, PhD Dissertation, Texas Tech University, Lubbock, TX, 1992.
  • 42
    E.L. Lawler, Optimal sequencing of a single machine subject to precedence constraints, Manage Sci 19 ( 1973), 544546.
  • 43
    K. Lee, B.C. Choi, Two-stage production scheduling with an outsourcing option, Eur J Oper Res 213 ( 2011), 489497.
  • 44
    R. Linn, W. Zhang, Hybrid flow shop scheduling: A survey, Comput Ind Eng 37 ( 1999), 5761.
  • 45
    C.L. Monma, A.H.G. Rinooy Kan, A concise survey of efficiently solvable special cases of the permutation flow-shop problem, RAIRO Res Opér 17 ( 1983), 105119.
  • 46
    J.M. Moore, An n job, one machine sequencing algorithm for minimizing the number of late Jobs, Manage Sci 15 ( 1968), 102109.
  • 47
    G. Mosheiov, Proportionate flow shops with general position-dependent processing times, Inform Process Lett 111 ( 2010), 174177.
  • 48
    G. Mosheiov, D. Oron, Minimizing the number of tardy jobs on a proportionate flow shop with general position-dependent processing times, Comput Oper Res 39 ( 2012), 16011604.
  • 49
    E. Nowicki, A. Zdrzalka, A two-machine flow shop scheduling problem with controllable job processing times, Eur J Oper Res 34 ( 1988), 208220.
  • 50
    P.S. Ow, Focused scheduling in proportionate flow shops, Manage Sci 31 ( 1985), 852869.
  • 51
    S.S. Panwalkar, R.A. Dudek, M.L. Smith, Sequencing research and industrial scheduling problem, S. Elmaghraby (Editor), in: Proceedings of Symposium on Theory of Scheduling and its Application, Springer-Verlag, New York, 1973, pp. 2938.
  • 52
    S.S. Panwalkar, A.W. Khan, An ordered flow-shop sequencing problem with mean completion time criterion, Int J Prod Res 14 ( 1976), 631635.
  • 53
    S.S. Panwalkar, A.W. Khan, A convex property of the ordered flow shop sequencing problem, Nav Res Log Q 24 ( 1977), 159162.
  • 54
    S.S. Panwalkar, A.W. Khan, An ordered flow shop sequencing problem with TWK type due dates and total tardiness criterion, J Appl Math 23 ( 1979), 367372.
  • 55
    S.S. Panwalkar, C. Koulamas, An algorithm for the variable common due date, minimal tardy jobs bi-criteria two-machine flow shop problem with ordered machines, Eur J Oper Res 211 ( 2012), 713.
  • 56
    S.S. Panwalkar, C.R. Woollam, Ordered flow shop problems with no in-process waiting: A special case, J Oper Res Soc 30 ( 1979), 661664.
  • 57
    S.S. Panwalkar, C.R. Woollam, Ordered flow shop problems with no in-process waiting: Further results, J Oper Res Soc 31 ( 1980), 10391043.
  • 58
    M. Pinedo, Minimizing the expected makespan in stochastic flow shops, Oper Res 30 ( 1982), 148162.
  • 59
    M. Pinedo, A note on stochastic shop models in which jobs have the same processing requirements on each machine, Manage Sci 31 ( 1985), 840845.
  • 60
    M. Pinedo, Scheduling: Theory algorithms, and systems, Prentice-Hall, Englewood Cliffs, NJ, 2002.
  • 61
    R.M.V. Rachamadugu, A. Vcpsalaincn, T.E. Morton, Scheduling in proportionate flow shops, CM U-R I-TK-83-1, Carnegie-Mellon University, Pittsburgh, PA, 1982.
  • 62
    A. Sen, E. Topaloglu, O. S. Benli, Optimal streaming of a single job in a two-stage flow shop, Eur J Oper Res 110 ( 1998), 4262.
  • 63
    D. Shabtay, G. Steiner, A survey of scheduling with controllable processing times, Discrete Appl Math 155 ( 2007), 16431666.
  • 64
    N. Shakhlevich, H.M. Hoogeveen, M. Pinedo, Minimizing total weighted completion time in a proportionate flow-shop, J Schedul 1 ( 1998), 157168.
  • 65
    M.L. Smith, A critical analysis of flow shop sequencing, PhD Dissertation, Texas Tech University, Lubbock, TX, 1968.
  • 66
    M.L. Smith, S.S. Panwalkar, R.A. Dudek, Flow shop sequencing problem with ordered processing time matrices, Manage Sci 21 ( 1975), 544549.
  • 67
    M.L. Smith, S.S. Panwalkar, R.A. Dudek, Flow shop sequencing problem with ordered processing time matrices: A general case, Nav Res Log Q 23 ( 1976), 481486.
  • 68
    W.E. Smith, Various optimizers for single state production, Nav Res Log Q 3 ( 1956), 5966.
  • 69
    Y. Sun, C. Zhang, L. Gao, X. Wang, Multi-objective optimization algorithms for flow shop scheduling problem: A review and prospects, Int J Adv Manuf Tech 55 ( 2011), 723739.
  • 70
    W. Szwarc, The critical path approach in the flow-shop problem, Opsearch 16 ( 1979), 98102.
  • 71
    J.A.A. Van Der Veen, R. Van Dal, Solvable cases of the no-wait flow-shop scheduling problem, J Oper Res Soc 42 ( 1991), 971980.
  • 72
    M. Widmer, A. Hertz, A new heuristic method for the flow shop sequencing problem, Eur J Oper Res 41 ( 1989), 186193.