Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource

Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource

0.00 Avg rating0 Votes
Article ID: iaor19921730
Country: Netherlands
Volume: 35
Issue: 2
Start Page Number: 205
End Page Number: 219
Publication Date: Mar 1992
Journal: Discrete Applied Mathematics
Authors: ,
Keywords: graphs
Abstract:

An edge coloring model is presented for a preemptive open shop problem. Constraints generated by a single resurce have to be taken into account. The case of a renewable and of a nonrenewable resource is considered. Since the existence of a schedule is an NP-complete problem in both cases the authors present some cases which are solvable in polynomial time.

Reviews

Required fields are marked *. Your email address will not be published.