Advertisement

Computing

, Volume 63, Issue 4, pp 299–316 | Cite as

Complexity Results for Single-Machine Problems with Positive Finish-Start Time-Lags

  • P. Brucker
  • S. Knust
Article

Abstract.

In a single-machine problem with time-lags a set of jobs has to be processed on a single machine in such a way that certain timing restrictions between the finishing and starting times of the jobs are satisfied and a given objective function is minimized. We consider the case of positive finish-start time-lags \(l_{ij}\) which mean that between the finishing time of job i and the starting time of job j the minimal distance \(l_{ij}\) has to be respected. New complexity results are derived for single-machine problems with constant positive time-lags \(l_{ij}=l\) which also lead to new results for flow-shop problems with unit processing times and job precedences.

AMS Subject Classifications:90B35. 
Key words.Complexity results, time-lags, single machine, flow-shop problem. 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Verlag, Wien 1999

Authors and Affiliations

  • P. Brucker
    • 1
  • S. Knust
    • 1
  1. 1.Universität Osnabrück, Fachbereich Mathematik/Informatik, D-49069 Osnabrück, Federal Republic of Germany, e-mail: {peter,sigrid}@mathematik.uni-osnabrueck.de DE

Personalised recommendations