Parallel machine scheduling with machine availability and eligibility constraints (Q2384614): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.ejor.2006.11.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033861214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling preemptable tasks on parallel processors with limited availability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2735585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling multiprocessor tasks on parallel processors with limited availability. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on parallel machines with release time and machine eligibility restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simple scheduling algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machines scheduling with machine shutdowns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machines scheduling with nonsimultaneous machine available time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Current trends in deterministic scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on ''parallel machine scheduling with non-simultaneous machine available time'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling of machine-dependent jobs with unit-length. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3962462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly on line scheduling of preemptive independent tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling on semi-identical processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Independent Tasks with Deadlines on Semi-identical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with limited machine availability / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:43, 27 June 2024

scientific article
Language Label Description Also known as
English
Parallel machine scheduling with machine availability and eligibility constraints
scientific article

    Statements

    Parallel machine scheduling with machine availability and eligibility constraints (English)
    0 references
    0 references
    0 references
    10 October 2007
    0 references
    Scheduling
    0 references
    parallel machines
    0 references
    network flows
    0 references
    availability constraint
    0 references
    eligibility constraint
    0 references

    Identifiers