An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown (Q2185825): 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.1007/s10878-020-00572-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3018661698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restarts can help in the on-line minimization of the maximum delivery time on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total weighted completion time with an unexpected machine unavailable interval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for single machine scheduling with one unavailability period / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling on a single machine with unexpected breakdown / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval / rank
 
Normal rank
Property / cites work
 
Property / cites work: PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling on two parallel machines with release dates and delivery times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal online algorithm for single machine scheduling with bounded delivery times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal online algorithm for scheduling on two identical machines with machine availability constraints. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A best on-line algorithm for single machine scheduling with small delivery times / rank
 
Normal rank
Property / cites work
 
Property / cites work: SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES / rank
 
Normal rank

Latest revision as of 20:37, 22 July 2024

scientific article
Language Label Description Also known as
English
An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown
scientific article

    Statements

    An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown (English)
    0 references
    0 references
    0 references
    0 references
    5 June 2020
    0 references
    semi-online scheduling
    0 references
    unexpected breakdown
    0 references
    competitive ratio
    0 references
    0 references

    Identifiers