Two branch-and-bound algorithms for the robust parallel machine scheduling problem (Q1762154): 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.cor.2011.09.019 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2011.09.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069959731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling on parallel identical machines to minimize total tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Scheduling of Tasks on Identical Parallel Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the identical parallel machine scheduling problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for the identical parallel machine‐scheduling problem: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Machine Scheduling by Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Project scheduling under uncertainty: survey and research potentials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust scheduling of parallel machines with sequence-dependent set-up costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with uncertain durations: Modeling \(\beta \)-robust scheduling with constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Discrete Model Representations via Symmetry Considerations / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2011.09.019 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:13, 11 December 2024

scientific article
Language Label Description Also known as
English
Two branch-and-bound algorithms for the robust parallel machine scheduling problem
scientific article

    Statements

    Two branch-and-bound algorithms for the robust parallel machine scheduling problem (English)
    0 references
    0 references
    15 November 2012
    0 references
    robust scheduling
    0 references
    identical parallel machines
    0 references
    stochastic processing times
    0 references

    Identifiers