Group scheduling in a two-stage flowshop

W H Yang ()
Additional contact information
W H Yang: Chao Yang University of Technology

Journal of the Operational Research Society, 2002, vol. 53, issue 12, 1367-1373

Abstract: 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.

Keywords: group scheduling; family set-up; makespan minimisation; branch-and-bound algorithm (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601454 Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:53:y:2002:i:12:d:10.1057_palgrave.jors.2601454

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2601454

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().