An exact algorithm for the preemptive single machine scheduling of equal-length jobs (Q2147002): 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.1016/j.cor.2022.105742 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4211077950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling equal-length jobs on identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for single-machine problems with positive finish-start time-lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete and continuous-time formulations for dealing with break periods: preemptive and non-preemptive scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The benefit of preemption for single machine scheduling so as to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single Machine Scheduling with Release Dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear assignment problems in combinatorial optimization / 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: The one-machine just-in-time scheduling problem with preemption / 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: Modeling single machine preemptive scheduling problems for computational efficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine problems with equal processing times: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of optimal schedules for the minimization total weighted completion time in preemptive equal-length job with release dates scheduling problem on a single machine / 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: Proving total dual integrality with cross-free families—A general framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4323632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness / 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: Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time / rank
 
Normal rank

Latest revision as of 09:51, 29 July 2024

scientific article
Language Label Description Also known as
English
An exact algorithm for the preemptive single machine scheduling of equal-length jobs
scientific article

    Statements

    An exact algorithm for the preemptive single machine scheduling of equal-length jobs (English)
    0 references
    0 references
    0 references
    22 June 2022
    0 references
    preemptive scheduling
    0 references
    total weighted completion time
    0 references
    equal processing times
    0 references
    branch and bound
    0 references
    heuristic
    0 references
    benchmark
    0 references
    0 references
    0 references
    0 references

    Identifiers