Single machine scheduling with discretely controllable processing times

In the field of machine scheduling problems with controllable processing times, it is often assumed that the possible processing time of a job can be continuously controlled, i.e. it can be any number in a given interval. In this paper, we introduce a discrete model in which job processing times are...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Operations research letters Ročník 21; číslo 2; s. 69 - 76
Hlavní autoři:	Chen, Zhi-Long, Lu, Qing, Tang, Guochun
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 01.09.1997 Elsevier
Témata:	Applied sciences Discretely controllable processing times Dynamic programming Exact sciences and technology NP-hardness Operational research and scientific management Operational research. Management science Scheduling, sequencing Single machine scheduling NP-hardness Dynamic programming Discretely controllable processing times Single machine scheduling Algorithms NP hard problem Production Scheduling Computational complexity Single machine
ISSN:	0167-6377, 1872-7468
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!