Necessary and sufficient conditions of optimality for some classical scheduling problems

被引：17

作者：

Lin, Yixun ^{[1
]}

Wang, Xiumei ^{[1
]}

机构：

[1] Zhengzhou Univ, Dept Math, Zhengzhou 450052, Henan, Peoples R China

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2007年 / 176卷 / 02期

基金：

中国国家自然科学基金;

关键词：

scheduling problems; optimality characterization; critical jobs; partial order;

D O I：

10.1016/j.ejor.2005.09.017

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

A scheduling problem is generally to order the jobs such that a certain objective function f(pi) is minimized. For some classical scheduling problems, only sufficient conditions of optimal solutions are concerned in the literature. In this paper, we study the necessary and sufficient conditions by means of the concept of critical ordering (critical jobs and their relations). These results are meaningful in recognition and characterization of optimal solutions of scheduling problems. (c) 2005 Elsevier B.V. All rights reserved.

引用

页码：809 / 818

页数：10

共 9 条

[1]

[Anonymous], 1983, Mathematical Programming The State of the Art, DOI DOI 10.1007/978-3-642-68874-4_9

[2]

BRUCKER P, 1998, SCHEDULING ALGORITHM

[3]

Chen B, 1998, Handbook of combinatorial optimization, P1493, DOI [DOI 10.1007/978-1-4613-0303-9_25, 10.1007/978-1-4613-0303-9_25]

[4]

Lawler E., 1976, Combinatorial Optimization: Networks and Matroids

[5]

LIN Y, 1997, OR T, V1, P41

[6]

LIN Y, 1999, OR T, V0003, P00010

[7]

Pinedo M., 1995, Scheduling: Theory, Algorithms, and Systems, V2nd

[8]

RIVAL I, 1985, LECT S COMB OPT WUH

[9] Augmentations of consistent partial orders for the one-machine total tardiness problem [J].

Yu, WC .

DISCRETE APPLIED MATHEMATICS, 1996, 68 (1-2) :189-202

← 1 →