IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Login to save this article or follow this journal

A taxonomy of flexible flow line scheduling procedures

  • Quadt, Daniel
  • Kuhn, Heinrich
Registered author(s):

    No abstract is available for this item.

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL: http://www.sciencedirect.com/science/article/B6VCT-4JW124S-7/2/8c1bae8a0a1b22532b89b92e4d387062
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Article provided by Elsevier in its journal European Journal of Operational Research.

    Volume (Year): 178 (2007)
    Issue (Month): 3 (May)
    Pages: 686-698

    as
    in new window

    Handle: RePEc:eee:ejores:v:178:y:2007:i:3:p:686-698
    Contact details of provider: Web page: http://www.elsevier.com/locate/eor

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

    as in new window
    1. Joseph Adams & Egon Balas & Daniel Zawack, 1988. "The Shifting Bottleneck Procedure for Job Shop Scheduling," Management Science, INFORMS, vol. 34(3), pages 391-401, March.
    2. Brah, Shaukat A. & Hunsucker, John L., 1991. "Branch and bound algorithm for the flow shop with multiple processors," European Journal of Operational Research, Elsevier, vol. 51(1), pages 88-99, March.
    3. Sriskandarajah, C. & Sethi, S. P., 1989. "Scheduling algorithms for flexible flowshops: Worst and average case performance," European Journal of Operational Research, Elsevier, vol. 43(2), pages 143-160, November.
    4. Brah, Shaukat A. & Loo, Luan Luan, 1999. "Heuristics for scheduling in a flow shop with multiple processors," European Journal of Operational Research, Elsevier, vol. 113(1), pages 113-122, February.
    5. Rahendran, Chandrasekharan & Chaudhuri, Dipak, 1992. "A multi-stage parallel-processor flowshop problem with minimum flowtime," European Journal of Operational Research, Elsevier, vol. 57(1), pages 111-122, February.
    6. Wardono, Bagas & Fathi, Yahya, 2004. "A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities," European Journal of Operational Research, Elsevier, vol. 155(2), pages 380-401, June.
    7. Moursli, O. & Pochet, Y., 2000. "A branch-and-bound algorithm for the hybrid flowshop," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 113-125, March.
    8. Portmann, M. -C. & Vignier, A. & Dardilhac, D. & Dezalay, D., 1998. "Branch and bound crossed with GA to solve hybrid flowshops," European Journal of Operational Research, Elsevier, vol. 107(2), pages 389-400, June.
    9. Djellab, Housni & Djellab, Khaled, 2002. "Preemptive Hybrid Flowshop Scheduling problem of interval orders," European Journal of Operational Research, Elsevier, vol. 137(1), pages 37-49, February.
    10. Riane, F. & Artiba, A. & Iassinovski, S., 2001. "An integrated production planning and scheduling system for hybrid flowshop organizations," International Journal of Production Economics, Elsevier, vol. 74(1-3), pages 33-48, December.
    11. Kurz, Mary E. & Askin, Ronald G., 2003. "Comparing scheduling rules for flexible flow lines," International Journal of Production Economics, Elsevier, vol. 85(3), pages 371-388, September.
    12. Negenman, Ebbe G., 2001. "Local search algorithms for the multiprocessor flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 128(1), pages 147-158, January.
    13. Nowicki, Eugeniusz & Smutnicki, Czeslaw, 1998. "The flow shop with parallel machines: A tabu search approach," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 226-253, April.
    14. Herbert G. Campbell & Richard A. Dudek & Milton L. Smith, 1970. "A Heuristic Algorithm for the n Job, m Machine Sequencing Problem," Management Science, INFORMS, vol. 16(10), pages B630-B637, June.
    15. Agnetis, A. & Pacifici, A. & Rossi, F. & Lucertini, M. & Nicoletti, S. & Nicolo, F. & Oriolo, G. & Pacciarelli, D. & Pesaro, E., 1997. "Scheduling of flexible flow lines in an automobile assembly plant," European Journal of Operational Research, Elsevier, vol. 97(2), pages 348-362, March.
    16. Botta-Genoulaz, Valerie, 2000. "Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 101-111, March.
    17. Kis, Tamas & Pesch, Erwin, 2005. "A review of exact solution methods for the non-preemptive multiprocessor flowshop problem," European Journal of Operational Research, Elsevier, vol. 164(3), pages 592-608, August.
    18. Azizoglu, Meral & Cakmak, Ergin & Kondakci, Suna, 2001. "A flexible flowshop problem with total flow time minimization," European Journal of Operational Research, Elsevier, vol. 132(3), pages 528-538, August.
    19. Rajendran, Chandrasekharan & Chaudhuri, Dipak, 1992. "Scheduling in n-job, m-stage flowshop with parallel processors to minimize makespan," International Journal of Production Economics, Elsevier, vol. 27(2), pages 137-143, May.
    20. NĂ©ron, Emmanuel & Baptiste, Philippe & Gupta, Jatinder N. D., 2001. "Solving hybrid flow shop problem using energetic reasoning and global operations," Omega, Elsevier, vol. 29(6), pages 501-511, December.
    21. Kurz, Mary E. & Askin, Ronald G., 2004. "Scheduling flexible flow lines with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 159(1), pages 66-82, November.
    Full references (including those not matched with items on IDEAS)

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:178:y:2007:i:3:p:686-698. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.