Uncertainty measure for the Bellman-Johnson problem with interval processing times (Q2452733): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3525910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming problems with inexact data: Exact and approximate solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of solutions in vector optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastically minimizing the makespan in two-machine flow shops without blocking / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Johnson's Two-Machine Flow Shop with Random Processing Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Johnson's problem with stochastic processing times and optimal service level / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3959422 / 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: On the robust single machine scheduling problem / 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: Schedule execution for two-machine flow-shop with interval processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total weighted flow time of a set of jobs with interval processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mean flow time minimization with given bounds of processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability criterion for a lexicographic Boolean optimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability criteria in vector combinatorial bottleneck problems in terms of binary relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability radius of a vector integer linear programming problem: Case of a regular norm in the space of criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative stability analysis for vector problems of 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of vector problems of integer optimization: relationship with the stability of sets of optimal and nonoptimal solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of a vector integer quadratic programming problem with respect to vector criterion and constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Different types of stability of vector integer optimization problem: General approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability analysis of an optimal balance for an assembly line with fixed cycle time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the calculation of the stability radius of an optimal or an approximate schedule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / 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: Scheduling arrivals to a production system in a fuzzy environment / 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: TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING 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: The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times / rank
 
Normal rank

Latest revision as of 13:44, 8 July 2024

scientific article
Language Label Description Also known as
English
Uncertainty measure for the Bellman-Johnson problem with interval processing times
scientific article

    Statements

    Uncertainty measure for the Bellman-Johnson problem with interval processing times (English)
    0 references
    0 references
    0 references
    5 June 2014
    0 references
    two-stage queuing system
    0 references
    interval processing time
    0 references
    uncertainty measure
    0 references
    0 references
    0 references

    Identifiers