Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines (Q2693572): 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 / OpenAlex ID
 
Property / OpenAlex ID: W2750522723 / 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: Q3425131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3673102 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling unit-length jobs with machine eligibility restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient retrieval selection algorithm for video servers with random duplicated assignment storage technique. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish load balancing and atomic congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delay-Optimal Server Allocation in Multiqueue Multiserver Systems With Time-Varying Connectivities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batching: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel batch scheduling with nested processing set restrictions / 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: Semi-matchings for bipartite graphs and load balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of scheduling problems with multi-purpose machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with equal processing times subject to machine eligibility constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multipurpose machine scheduling with rejection and identical job processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling equal length jobs with eligibility restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ideal schedules in parallel machine settings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling unit length jobs with parallel nested machine processing set restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:29, 31 July 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines
scientific article

    Statements

    Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines (English)
    0 references
    0 references
    24 March 2023
    0 references
    scheduling
    0 references
    uniform parallel batch machines
    0 references
    processing set restrictions
    0 references
    equal job lengths
    0 references
    exact algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers