Makespan minimization for two parallel machines with an availability constraint (Q1887910): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2003.08.034 / 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.ejor.2003.08.034 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048135710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4865763 / 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: Two-machine flowshop scheduling with availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs and maintenance activities on parallel machines / 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: Current trends in deterministic scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated two-parallel machines scheduling to minimize sum of job completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the sum of job completion times on capacitated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525911 / 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
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2003.08.034 / rank
 
Normal rank

Latest revision as of 11:44, 16 December 2024

scientific article
Language Label Description Also known as
English
Makespan minimization for two parallel machines with an availability constraint
scientific article

    Statements

    Makespan minimization for two parallel machines with an availability constraint (English)
    0 references
    0 references
    0 references
    0 references
    22 November 2004
    0 references
    Scheduling
    0 references
    Parallel machine
    0 references
    Availability constraint
    0 references
    Makespan minimization
    0 references

    Identifiers