Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty (Q6094564): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Complexity of single machine scheduling problems under scenario-based uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong NP-hardness of minimizing total deviation with generalized and periodic due dates / 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: A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unary NP-hardness of minimizing total weighted tardiness with generalized due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A contribution to the stochastic flow shop scheduling problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Fixed Delivery Dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of generalized due date scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Risk-averse single machine scheduling: complexity and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the SPT heuristic for solving scheduling problems with generalized due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minmax common-due-date problem: extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3824092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3197606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fuzzy robust scheduling approach for product development projects. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with a position-weighted learning effect and job release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4034337 / rank
 
Normal rank

Revision as of 02:55, 3 August 2024

scientific article; zbMATH DE number 7747893
Language Label Description Also known as
English
Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty
scientific article; zbMATH DE number 7747893

    Statements

    Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty (English)
    0 references
    0 references
    0 references
    0 references
    10 October 2023
    0 references
    scheduling
    0 references
    NP-hardness
    0 references
    generalized due dates
    0 references
    genetic algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers