Minimizing total completion time on a single machine with a flexible maintenance activity (Q613512): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.cor.2010.09.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2168184085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Current trends in deterministic scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling 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: Single machine flow-time scheduling with a single breakdown / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine flow-time scheduling with scheduled maintenance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with an availability constraint / 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: Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for two single machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling with availability constraints to minimize total weighted completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a maintenance activity to minimize total weighted completion-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note: Simple heuristics for scheduling a maintenance activity on unrelated machines / 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: Scheduling a maintenance activity on parallel identical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling the maintenance on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on worst-case performance of heuristics for maintenance scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with tool changes to minimize total completion time: Basic results and SPT performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with flexible and periodic maintenance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the cardinality constrained \(P \|C_{max}\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan for two parallel machines with job limit on each availability interval / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-machine flowshop scheduling problem with a separated maintenance constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs under increasing linear machine maintenance time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Considering scheduling and preventive maintenance in the flowshop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Weighted Completion Times with Deadlines / 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: Weighted flow time bounds for scheduling identical processors / rank
 
Normal rank

Latest revision as of 13:44, 3 July 2024

scientific article
Language Label Description Also known as
English
Minimizing total completion time on a single machine with a flexible maintenance activity
scientific article

    Statements

    Minimizing total completion time on a single machine with a flexible maintenance activity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 December 2010
    0 references
    single machine scheduling
    0 references
    flexible maintenance
    0 references
    shortest processing time
    0 references
    dynamic programming
    0 references
    branch-and-bound
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references