Parallel machine scheduling with a convex resource consumption function

We consider some problems of scheduling jobs on identical parallel machines where job-processing times are controllable through the allocation of a nonrenewable common limited resource. The objective is to assign the jobs to the machines, to sequence the jobs on each machine and to allocate the reso...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	European journal of operational research Ročník 173; číslo 1; s. 92 - 107
Hlavní autoři:	Shabtay, Dvir, Kaspi, Moshe
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 16.08.2006 Elsevier Elsevier Sequoia S.A
Edice:	European Journal of Operational Research
Témata:	Applied sciences Computational complexity Equivalent load method Exact sciences and technology Flows in networks. Combinatorial problems Job shops Operational research and scientific management Operational research. Management science Operations research Optimization Parallel machine scheduling Production scheduling Resource allocation Scheduling Scheduling, sequencing Sequential scheduling Studies Scheduling Parallel machine scheduling Computational complexity Equivalent load method Resource allocation Task scheduling Parallel machines Controllability Makespan Combinatorial optimization Precedence constraint Completion time
ISSN:	0377-2217, 1872-6860
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!