Skip to main content
SpringerLink
Log in

Group scheduling in a two-stage flowshop

  • Theoretical Paper
  • Published:
Journal of the Operational Research Society

Abstract

This paper investigates a two-stage flowshop group scheduling problem with the objective of minimising makespan (the completion time of the last job). In the multiple-stage group scheduling, each job is generally classified into one family by considering its characteristics at all stages as a whole. However, in this study, each job is classified into multiple families, one family per stage. For this problem, two heuristics based on the branch-and-bound algorithm are constructed and their efficiencies are investigated.

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. Department of Business Administration, Chao Yang University of Technology, Taichung, Taiwan

    W H Yang

Authors
  1. W H Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to W H Yang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yang, W. Group scheduling in a two-stage flowshop. J Oper Res Soc 53, 1367–1373 (2002). https://doi.org/10.1057/palgrave.jors.2601454

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/palgrave.jors.2601454

Keywords

Search

Navigation