Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance (Q2156319): 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-021-00715-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3134021171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single batch machine scheduling with deliveries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for batch scheduling with nonidentical job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supply chain scheduling problem in the hospital with periodic working time on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with a restricted rate-modifying activity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with periodic maintenance to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with periodic maintenance and nonresumable jobs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The medical laboratory scheduling for weighted flow-time / 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 a single batch processing machine with non-identical job sizes / 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: Single-machine scheduling with periodic maintenance to minimize makespan revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on a single batch processing machine with nonidentical job sizes / rank
 
Normal rank

Latest revision as of 16:20, 29 July 2024

scientific article
Language Label Description Also known as
English
Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance
scientific article

    Statements

    Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance (English)
    0 references
    0 references
    0 references
    18 July 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    periodic maintenance
    0 references
    parallel-batch machine
    0 references
    approximation algorithm
    0 references
    0 references