Note---A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness

Tapan Sen, Farhad M. E. Raiszadeh and Parthasarati Dileepan
Additional contact information
Tapan Sen: Department of Management, University of Tennessee, Chattanooga, Tennessee 37403
Farhad M. E. Raiszadeh: Department of Management, University of Tennessee, Chattanooga, Tennessee 37403
Parthasarati Dileepan: Department of Management, University of Tennessee, Chattanooga, Tennessee 37403

Management Science, 1988, vol. 34, issue 2, 254-260

Abstract: This paper considers a bicriterion scheduling problem where a linear combination of two objective functions is considered, with weighting factors used to represent relative importance of the two criteria, i.e., total flowtime and range of lateness. A branch-and-bound solution procedure is designed for the problem. Computational results are also reported.

Keywords: production/scheduling: job shop; deterministic; decision analysis: criteria; programming: multiple criteria (search for similar items in EconPapers)
Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.34.2.254 (application/pdf)

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:inm:ormnsc:v:34:y:1988:i:2:p:254-260

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().