Measures of problem uncertainty for scheduling with interval processing times
From MaRDI portal
Recommendations
- Minimizing total weighted flow time of a set of jobs with interval processing times
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
- Uncertainty measure for the Bellman-Johnson problem with interval processing times
- Single machine scheduling problem with interval processing times and total completion time objective
Cites work
- scientific article; zbMATH DE number 5345854 (Why is no real title available?)
- scientific article; zbMATH DE number 724323 (Why is no real title available?)
- scientific article; zbMATH DE number 782644 (Why is no real title available?)
- A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
- A comparison of stochastic programming and bi-objective optimisation approaches to robust airline crew scheduling
- Executing production schedules in the face of uncertainties: a review and some future directions
- Makespan estimation and order acceptance in batch process industries when processing times are uncertain
- Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
- Minimizing total weighted flow time of a set of jobs with interval processing times
- Minimizing total weighted flow time under uncertainty using dominance and a stability box
- On the robust single machine scheduling problem
- One machine scheduling problem with fuzzy random due-dates
- Optimal two- and three-stage production schedules with set-up time included
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Robust discrete optimization and its applications
- Scheduling arrivals to a production system in a fuzzy environment
- Scheduling under fuzziness
- Sequencing with uncertain numerical data for makespan minimisation
- 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
- Workload based order acceptance in job shop environments
Cited in
(15)- On the operational definition of processing time uncertainty
- Scatter search based algorithms for min-max regret task scheduling problems with interval uncertainty
- Stability polyhedra of optimal permutation of jobs servicing
- Scheduling jobs with uncertain parameters: analysis of research directions
- scientific article; zbMATH DE number 1539053 (Why is no real title available?)
- Reexamination of processing time uncertainty
- Single machine scheduling problem with interval processing times to minimize mean weighted completion time
- Optimality region for job permutation in single-machine scheduling with uncertain processing times
- An efficient bicriteria algorithm for stable robotic flow shop scheduling
- Single machine scheduling problem with interval processing times and total completion time objective
- Minimizing total weighted completion time with uncertain data: a stability approach
- Optimal control algorithms and their analysis for short-term scheduling in manufacturing systems
- Minimizing total weighted flow time of a set of jobs with interval processing times
- Minimizing total weighted flow time under uncertainty using dominance and a stability box
- Uncertainty measure for the Bellman-Johnson problem with interval processing times
This page was built for publication: Measures of problem uncertainty for scheduling with interval processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2393127)
