Uncertainty measure for the Bellman-Johnson problem with interval processing times
From MaRDI portal
Publication:2452733
DOI10.1007/s10559-012-9445-4zbMath1288.90016MaRDI QIDQ2452733
N. M. Matsveichuka, Yu. N. Sotskova
Publication date: 5 June 2014
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-012-9445-4
90B22: Queues and service in operations research
90B36: Stochastic scheduling theory in operations research
Related Items
Stability polyhedra of optimal permutation of jobs servicing, 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
Cites Work
- Unnamed Item
- Unnamed Item
- On the robust single machine scheduling problem
- Stability criteria in vector combinatorial bottleneck problems in terms of binary relations
- Different types of stability of vector integer optimization problem: General approach
- Minimizing total weighted flow time of a set of jobs with interval processing times
- Scheduling arrivals to a production system in a fuzzy environment
- On the calculation of the stability radius of an optimal or an approximate schedule
- Optimal makespan scheduling with given bounds of processing times
- Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times
- Stochastically minimizing the makespan in two-machine flow shops without blocking
- Integer programming problems with inexact data: Exact and approximate solutions
- Mean flow time minimization with given bounds of processing times
- Quantitative stability analysis for vector problems of 0-1 programming
- Stability radius of a vector integer linear programming problem: Case of a regular norm in the space of criteria
- Stability of a vector integer quadratic programming problem with respect to vector criterion and constraints
- Schedule execution for two-machine flow-shop with interval processing times
- Stability criterion for a lexicographic Boolean optimization problem
- Stability of vector problems of integer optimization: relationship with the stability of sets of optimal and nonoptimal solutions
- Stability analysis of an optimal balance for an assembly line with fixed cycle time
- Johnson's problem with stochastic processing times and optimal service level
- Optimal two- and three-stage production schedules with setup times included
- The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times
- Sequencing with uncertain numerical data for makespan minimisation
- TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING TIMES
- On Johnson's Two-Machine Flow Shop with Random Processing Times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Flowshop scheduling problem to minimize total completion time with random and bounded processing times
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Existence of solutions in vector optimization problems
