BICRITERION JOBSHOP SCHEDULING WITH TOTAL FLOWTIME AND SUM OF SQUARED LATENESS

被引：5

作者：

DILEEPAN, P

SEN, T

机构：

[1] Management Department, School of Business Administration, The University of Tennessee at Chattanooga, Chattanooga

来源：

ENGINEERING COSTS AND PRODUCTION ECONOMICS | 1991年 / 21卷 / 03期

关键词：

D O I：

10.1016/0167-188X(91)90008-P

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

In this paper sufficient conditions for optimality for the single machine job scheduling problem with a linear combination of total flowtime and sum of squared lateness as the objective function are developed. Based on the sufficient conditions a lower bound for the objective function for a given schedule is derived. A branch-and-bound procedure incorporating the lower bound has also been developed. In addition, we also show how to fathom nodes in the branching tree using the a-priori precedence relationships among the jobs that can be determined using the sufficient conditions. Computational experiment for the branch-and-bound and its results are also presented.

引用

页码：295 / 299

页数：5

共 9 条

[1]

Gupta, Sen, Minimizing a quadratic function of job lateness on a single machine, Eng. Costs Prod. Econ., 7, 3, pp. 187-194, (1983)

[2]

Baker, Nuttle, Sequencing independent jobs with a single resource, Nav. Res. Log. Q., 27, 3, pp. 499-510, (1980)

[3]

Bianco, Ricciardelli, Scheduling of a single machine to minimize total weighted completion time subject to release dates, Naval Research Logistics Quarterly, 29, 1, pp. 151-167, (1982)

[4]

Van Wassenhove, Baker, A Bicriterion Approach to Time/Cost Trade-Offs in Sequencing, Eur. J. Oper. Res., 4, 1, pp. 42-48, (1980)

[5]

Van Wassenhove, Gelders, Solving a bicriterion scheduling problem, Eur. J. Oper. Res., 4, 1, pp. 42-48, (1980)

[6]

Sen, Gupta, A branch-and-bound procedure to solve a bicriterion scheduling problem, IIE Trans., 15, 1, pp. 84-88, (1983)

[7]

Sen, Raiszadeh, Dileepan, Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness, Management Science, 34, 2, pp. 254-260, (1988)

[8]

Townsend, The single machine problem with quadratic penalty function of completion times: A branch-and-bound solution, Manage. Sci., 24, 5, pp. 530-534, (1978)

[9]

Fisher, A dual algorithm for the one-machine scheduling problem, Mathematical Programming, 11, 3, pp. 229-281, (1971)

← 1 →