Minimizing Weighted Completion Times with Deadlines

1 June 1985

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research

Vol. 33 (3) , 562-574
https://doi.org/10.1287/opre.33.3.562

Abstract

We examine a one-machine scheduling problem whose objective is to minimize the weighted sum of completion times, subject to deadline constraints. We synthesize and extend current known theory, and derive precedence relations between jobs. These relationships, along with tight new bounding criteria, are incorporated in a branch and bound solution procedure.

Keywords

COMPLETION TIMES
DEADLINES
BOUNDING CRITERIA
WEIGHTED COMPLETION
SCHEDULING PROBLEM
DEADLINE CONSTRAINTS
DERIVE PRECEDENCE
NEW BOUNDING
PRECEDENCE RELATIONS
SOLUTION PROCEDURE

This publication has 0 references indexed in Scilit: