Minimizing total weighted flow time of a set of jobs with interval processing times (Q969917): 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.mcm.2009.03.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2042025920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525910 / 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: REGULARITY RESULTS FOR TIME-DEPENDENT VARIATIONAL AND QUASI-VARIATIONAL INEQUALITIES AND APPLICATION TO THE CALCULATION OF DYNAMIC TRAFFIC NETWORK / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal makespan scheduling with given bounds of processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing with uncertain numerical data for makespan minimisation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax regret solutions for minimax optimization problems with uncertainty / 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: 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: On the robust single machine scheduling problem / 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: On the complexity of a class of combinatorial optimization problems with uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of machine scheduling for stability with a single disrupted job / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling for stability in single-machine production systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop minimum-length scheduling problem with random and bounded processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop scheduling problem to minimize total completion time with random and bounded processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Schedule execution for two-machine flow-shop with interval processing times / rank
 
Normal rank

Latest revision as of 20:07, 2 July 2024

scientific article
Language Label Description Also known as
English
Minimizing total weighted flow time of a set of jobs with interval processing times
scientific article

    Statements

    Minimizing total weighted flow time of a set of jobs with interval processing times (English)
    0 references
    8 May 2010
    0 references
    0 references
    single-machine scheduling
    0 references
    uncertainty
    0 references
    domination
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references