Uncertainty measure for the Bellman-Johnson problem with interval processing times

Recommendations

Measures of problem uncertainty for scheduling with interval processing times
Minimizing total weighted flow time of a set of jobs with interval processing times
Two-machine flow-shop minimum-length scheduling with interval processing times
Single machine scheduling problem with interval processing times and total completion time objective
The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times

Cites work

Different types of stability of vector integer optimization problem: General approach
Existence of solutions in vector optimization problems
Flowshop scheduling problem to minimize total completion time with random and bounded processing times
scientific article; zbMATH DE number 5345853 (Why is no real title available?)
scientific article; zbMATH DE number 3780553 (Why is no real title available?)
Integer programming problems with inexact data: Exact and approximate solutions
Johnson's problem with stochastic processing times and optimal service level
Mean flow time minimization with given bounds of processing times
Minimizing total weighted flow time of a set of jobs with interval processing times
On Johnson's Two-Machine Flow Shop with Random Processing Times
On the calculation of the stability radius of an optimal or an approximate schedule
On the robust single machine scheduling problem
Optimal makespan scheduling with given bounds of processing times
Optimal two- and three-stage production schedules with set-up time included
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Quantitative stability analysis for vector problems of 0-1 programming
Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
Schedule execution for two-machine flow-shop with interval processing times
Scheduling arrivals to a production system in a fuzzy environment
Sequencing with uncertain numerical data for makespan minimisation
Stability analysis of an optimal balance for an assembly line with fixed cycle time
Stability criteria in vector combinatorial bottleneck problems in terms of binary relations
Stability criterion for a lexicographic Boolean optimization problem
Stability of a vector integer quadratic programming problem with respect to vector criterion and constraints
Stability of vector problems of integer optimization: relationship with the stability of sets of optimal and nonoptimal solutions
Stability radius of a vector integer linear programming problem: Case of a regular norm in the space of criteria
Stochastically minimizing the makespan in two-machine flow shops without blocking
The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times
Two-machine flow-shop minimum-length scheduling with interval processing times
Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times

Cited in

(6)

Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness
A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure
Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times
Measures of problem uncertainty for scheduling with interval processing times
On the operational definition of processing time uncertainty
Stability polyhedra of optimal permutation of jobs servicing

This page was built for publication: Uncertainty measure for the Bellman-Johnson problem with interval processing times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2452733)