Structure of Optimal Solution for E/T Scheduling

XIE Tiejun; CHENG Tao; LIU Renping

doi:10.13374/j.issn1001-053x.2000.03.026

Volume 22 Issue 3

Aug. 2021

Turn off MathJax

Article Contents

Article Navigation > Chinese Journal of Engineering > 2000 > 22(3): 284-288

XIE Tiejun, CHENG Tao, LIU Renping. Structure of Optimal Solution for E/T Scheduling[J]. Chinese Journal of Engineering, 2000, 22(3): 284-288. doi: 10.13374/j.issn1001-053x.2000.03.026

Citation:

XIE Tiejun, CHENG Tao, LIU Renping. Structure of Optimal Solution for E/T Scheduling[J]. Chinese Journal of Engineering, 2000, 22(3): 284-288. doi: 10.13374/j.issn1001-053x.2000.03.026

XIE Tiejun, CHENG Tao, LIU Renping. Structure of Optimal Solution for E/T Scheduling[J]. Chinese Journal of Engineering, 2000, 22(3): 284-288. doi: 10.13374/j.issn1001-053x.2000.03.026

Citation:

XIE Tiejun, CHENG Tao, LIU Renping. Structure of Optimal Solution for E/T Scheduling[J]. Chinese Journal of Engineering, 2000, 22(3): 284-288. doi: 10.13374/j.issn1001-053x.2000.03.026

PDF( 566 KB)

Structure of Optimal Solution for E/T Scheduling

doi: 10.13374/j.issn1001-053x.2000.03.026

1. Applied Science School, UST Beijing, Beijing 100083, China;
2. Beijing University of Aeronautics & Astronautics, Beijing 100083, China;
3. Dept of Computer Science and Engineering, Tsinghua Universty Beijing 10084, China

Received Date: 1999-10-21
Available Online: 2021-08-27

Abstract

Abstract

A kind of E/T scheduling problem with four penalty factor is discussed in order to determine the optimal sequences and optimal common due date. A method about how to determine common due date is presented, the concept of combinative penalty factor is proposed, and the structure of optimal solution is discussed.
- E/T scheduling,
- completion time,
- due date,
- penalty factor