Scheduling with jobs at fixed positions

In this paper, we study classical single machine scheduling problems with the additional constraint that a set of special jobs must be scheduled at certain positions in the job sequence. In other words, a special job must start when a certain number of jobs have finished on the machine. We analyze s...

Celý popis

Podrobná bibliografia

Vydané v:	European journal of operational research Ročník 318; číslo 2; s. 388 - 397
Hlavný autor:	Jaehn, Florian
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 16.10.2024
Predmet:	Maintenance scheduling polynomial-time algorithms Maintenance scheduling polynomial-time algorithms
ISSN:	0377-2217
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!