Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource (Q1186309): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57387906, #quickstatements; #temporary_batch_1714786519576 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5615282 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3821925 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Preemptive scheduling with staircase and piecewise linear resource availability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5604409 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5514188 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3048571 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Investigations on an edge coloring problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Preemptive Scheduling, Linear Programming and Network Flows / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A preemptive open shop scheduling problem with one resource / rank | |||
Normal rank |
Latest revision as of 17:03, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource |
scientific article |
Statements
Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource (English)
0 references
28 June 1992
0 references
The authors investigate relations between an edge coloring problem and a preemptive open shop scheduling problem with constraints generated by one resource \(R\). In particular, they consider two complementary cases: when \(R\) is renewable and when \(R\) is nonrenewable. Each of these constraints causes that the general problem becomes NP-complete. Therefore they present some special cases which can be solved efficiently. Though the authors do not give any particular scheduling algorithm, they claim that those special cases lead to polynomial-time algorithms.
0 references
bipartite graph
0 references
renewable and nonrenewable resource
0 references
edge coloring
0 references
preemptive open shop scheduling
0 references
NP-complete
0 references
polynomial-time algorithms
0 references