Concurrent operations can be parallelized in scheduling multiprocessor job shop (Q1607976): 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: Evgeny V. Shchepin / rank
Normal rank
 
Property / author
 
Property / author: Evgeny V. Shchepin / 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.1002/jos.101 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2028128054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job-shop scheduling with multi-purpose machines / 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: Lower bounds for the job-shop scheduling problem on multi-purpose machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Shop Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending the shifting bottleneck procedure to real-life applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical job shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Solving the Job-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job-Shop Scheduling by Implicit Enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:27, 4 June 2024

scientific article
Language Label Description Also known as
English
Concurrent operations can be parallelized in scheduling multiprocessor job shop
scientific article

    Statements

    Concurrent operations can be parallelized in scheduling multiprocessor job shop (English)
    0 references
    0 references
    0 references
    0 references
    8 August 2002
    0 references
    0 references
    multiprocessor job shop scheduling
    0 references
    unrelated machines
    0 references
    solution tree
    0 references
    0 references