Two-machine flow shop and open shop scheduling problems with a single maintenance window (Q724106): 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.ejor.2018.04.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2800473148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine open shop scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-preemptive two-machine open shop scheduling with non-availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Three-Machine Open Shop Scheduling / 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: An improved heuristic for two-machine flowshop scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flow shops with limited machine availability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation results for flow shop scheduling problems with machine availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flow shop no-wait scheduling with machine maintenance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning Machine Maintenance in Two-Machine Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop scheduling with availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with a rate-modifying activity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a deteriorating maintenance activity on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for scheduling a two-machine flowshop with one unavailability interval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3964013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cyclical search for the two machine flow shop and open shop to minimise finishing time / 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: Single-machine scheduling with periodic maintenance to minimize makespan revisited / rank
 
Normal rank

Latest revision as of 05:33, 16 July 2024

scientific article
Language Label Description Also known as
English
Two-machine flow shop and open shop scheduling problems with a single maintenance window
scientific article

    Statements

    Two-machine flow shop and open shop scheduling problems with a single maintenance window (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 July 2018
    0 references
    0 references
    scheduling
    0 references
    flow shop
    0 references
    open shop
    0 references
    machine maintenance start window
    0 references
    approximation algorithm
    0 references
    0 references
    0 references
    0 references