Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time (Q2926062): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/10556788.2013.854360 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037005161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with release dates on a single machine to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with equal processing times and time windows on identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower tolerance-based branch and bound algorithms for the ATSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 1. 47-approximation for a preemptive single-machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single Machine Scheduling with Release Dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for single machine sequencing with release dates to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3899811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer-Aided complexity classification of combinational problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with limited machine availability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank

Latest revision as of 06:09, 9 July 2024

scientific article
Language Label Description Also known as
English
Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time
scientific article

    Statements

    Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 October 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    single machine scheduling
    0 references
    weighted shortest remaining processing time
    0 references
    WSRPT rule
    0 references
    efficient heuristic
    0 references
    0 references