Scheduling chains on a single machine with non-negative time lags

Alix Munier and Francis Sourd

Mathematical Methods of Operations Research, 2003, vol. 57, issue 1, 123 pages

Abstract: Chains of operations have to be scheduled on a single machine such that a minimum delay is set between any two operations linked by a precedence relation. Three sub-problems are shown to be solved in polynomial time. First, we consider the problem of minimizing the makespan when all the operations have the same duration p and all the delays are equal to a constant l. Next, we consider that the length of any delay is less than the shortest processing time and we present an algorithm to minimize the makespan and another one to minimize the flow time when all the processing times are equal. Copyright Springer-Verlag Berlin Heidelberg 2003

Keywords: Key words: deterministic scheduling; single machine problems; time-lags; complexity (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860200242 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:57:y:2003:i:1:p:111-123

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860200242

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().