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

Tapan Sen | Zendy; Farhad M. E. Raiszadeh | Zendy; Parthasarati Dileepan | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Tapan Sen,

Farhad M. E. Raiszadeh,

Parthasarati Dileepan

Publication year - 1988

Publication title -

management science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 4.954

H-Index - 255

eISSN - 1526-5501

pISSN - 0025-1909

DOI - 10.1287/mnsc.34.2.254

Subject(s) - weighting , mathematical optimization , branch and bound , scheduling (production processes) , job shop scheduling , range (aeronautics) , computer science , operations research , mathematics , engineering , schedule , medicine , radiology , aerospace engineering , operating system

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.production/scheduling: job shop, deterministic, decision analysis: criteria, programming: multiple criteria

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research