SciELO - Scientific Electronic Library Online

 
vol.24 issue1A multi-phase heuristic for the delivery pick-up vehicle-routing problem with time-windowsPerformance of the truncated Newton method in unconstrained nonlinear optimization author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • Have no similar articlesSimilars in SciELO

Share


Investigação Operacional

Print version ISSN 0874-5161

Abstract

VALENTE, Jorge M. S.  and  ALVES, Rui A. F. S.. A note on polynomially-solvable cases of common due date early-tardy scheduling with release dates. Inv. Op. [online]. 2004, vol.24, n.1, pp.63-71. ISSN 0874-5161.

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.

Keywords : scheduling; early-tardy; common due date; unit processing times; release dates.

        · text in English     · English ( pdf )