The complexity of machine scheduling for stability with a single disrupted job (Q2488217): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q213375 / rank
Normal rank
 
Property / author
 
Property / author: Willy S. Herroelen / rank
 
Normal rank
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.orl.2004.04.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084568263 / 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: Match-up scheduling under a machine breakdown / rank
 
Normal rank
Property / cites work
 
Property / cites work: Executing production schedules in the face of uncertainties: a review and some future directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchup Scheduling with Multiple Resources, Release Dates and Disruptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling independent tasks to reduce mean finishing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling chain-structured tasks to minimize makespan and mean flow time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rescheduling for New Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: The construction of stable project baseline schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sequencing of a Single Machine Subject to Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scheduling under Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predictable scheduling of a single machine with breakdowns and sensitive jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-machine rescheduling heuristics with efficiency and stability as criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robust coloring problem. / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:34, 10 June 2024

scientific article
Language Label Description Also known as
English
The complexity of machine scheduling for stability with a single disrupted job
scientific article

    Statements

    The complexity of machine scheduling for stability with a single disrupted job (English)
    0 references
    0 references
    0 references
    25 August 2005
    0 references
    Scheduling
    0 references
    Uncertainty
    0 references
    Robustness
    0 references
    Stability
    0 references
    Complexity
    0 references

    Identifiers