A note on polynomially-solvable cases of common due date early-tardy scheduling with release dates
In this paper we consider the single machine scheduling problem with integer release dates and the objective of minimising the sum of deviations of jobs' completion times from a common integer due date. We present an efficient polynomial algorithm for the unit processing time case. We also show how to calculate in polynomial time the minimum non-restrictive due date for the general case.
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Digital revista |
| Language: | English |
| Published: |
APDIO - Associação Portuguesa de Investigação Operacional
2004
|
| Online Access: | http://scielo.pt/scielo.php?script=sci_arttext&pid=S0874-51612004000100004 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|