Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty (Q322893): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2015.12.046 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C60 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6636225 / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling
Property / zbMATH Keywords: scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
uncertainty
Property / zbMATH Keywords: uncertainty / rank
 
Normal rank
Property / zbMATH Keywords
 
outsourcing
Property / zbMATH Keywords: outsourcing / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / 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.ejor.2015.12.046 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2238955734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the number of late jobs on a single machine under due date uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of min-max and min-max regret versions of some combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey / rank
 
Normal rank
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: Multiprocessor Scheduling with Rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competition and Outsourcing with Scale Economies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flow shop scheduling problem with an outsourcing option / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outsourcing and scheduling for two-machine ordered flow shop scheduling problems / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for minclique scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating a two-machine flow shop scheduling under discrete scenario uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for interval data minmax regret combinatorial optimization 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: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of minimizing the total flow time with interval data and minmax regret criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with scenarios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the robust single machine scheduling problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2015.12.046 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:19, 9 December 2024

scientific article
Language Label Description Also known as
English
Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
scientific article

    Statements

    Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty (English)
    0 references
    0 references
    0 references
    7 October 2016
    0 references
    scheduling
    0 references
    uncertainty
    0 references
    outsourcing
    0 references
    computational complexity
    0 references
    0 references

    Identifiers