Parallel dedicated machines scheduling with chain precedence constraints

A set of n nonpreemptive tasks are to be scheduled on m parallel dedicated machines with a regular criterion. Chain precedence constraints among the tasks, deterministic processing times and processing machine of each task are given.

MoreLess

Year of publication:	2012
Authors:	Agnetis, Alessandro ; Kellerer, Hans ; Nicosia, Gaia ; Pacifici, Andrea
Published in:	European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 221.2012, 2, p. 296-305
Publisher:	Elsevier
Subject:	Scheduling \| Parallel dedicated machines \| Precedence constraints \| Two-job job shop \| Computational complexity

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010597659