Skip to main content
SpringerLink
Log in

Two-machine flow shop scheduling problems with minimal and maximal delays

  • Published:
4OR Aims and scope Submit manuscript

Abstract.

In this paper, we show lower bounds and upper bounds for the F2/max delay/Cmax problem. These bounds allow us to build a branch-and-bound procedure. Computational experiments reveal that these bounds and the associated branch-and-bound procedure are efficient.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique, Université F. Rabelais, Polytech'Tours, 64 av. Jean Portalis, 37200 , Tours, France

    Jean-Louis Bouquard & Christophe Lenté

Authors
  1. Jean-Louis Bouquard
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christophe Lenté
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jean-Louis Bouquard.

Additional information

Received: May 2004 / Revised version: February 2005

AMS classification:

90B35, 90C57

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bouquard, JL., Lenté, C. Two-machine flow shop scheduling problems with minimal and maximal delays. 4OR 4, 15–28 (2006). https://doi.org/10.1007/s10288-005-0069-7

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-005-0069-7

Keywords:

Search

Navigation