Open shop scheduling problems with conflict graphs (Q2357137): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Nour El Houda Tellache / rank
Normal rank
 
Property / author
 
Property / author: Nour El Houda Tellache / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2017.04.031 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2620006440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mutual exclusion scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs on identical machines with agreement graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling: agreement graph vs resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3821925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling subject to resource constraints: Classification and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with incompatible jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive heuristic algorithms for the open shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch \(\&\) bound algorithm for the open-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource / rank
 
Normal rank
Property / cites work
 
Property / cites work: Addendum: Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource / rank
 
Normal rank
Property / cites work
 
Property / cites work: A preemptive open shop scheduling problem with one resource / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with conflicts: Online and offline algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mutual exclusion scheduling with interval graphs or related classes. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical and new heuristics for the open-shop problem: A computational evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Machine Open Shops with Renewable Resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling the two-machine open shop problem under resource constraints for setting the jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on greedy algorithms for the maximum weighted independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit-time scheduling problems with time dependent resources / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:38, 13 July 2024

scientific article
Language Label Description Also known as
English
Open shop scheduling problems with conflict graphs
scientific article

    Statements

    Open shop scheduling problems with conflict graphs (English)
    0 references
    0 references
    0 references
    19 June 2017
    0 references
    open shop scheduling
    0 references
    conflict graphs
    0 references
    complexity
    0 references
    heuristics
    0 references
    lower bounds
    0 references
    makespan
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers