Robust scheduling on a single machine to minimize total flow time
From MaRDI portal
Recommendations
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
- Algorithms and complexity analysis for robust single-machine scheduling problems
- On the robust single machine scheduling problem
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
Cites work
- A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
- A simulated annealing and hill-climbing algorithm for the traveling tournament problem
- A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors
- A survey of scheduling problems with setup times or costs
- A survey of simulated annealing as a tool for single and multiobjective optimization
- An algorithm for the resource constrained shortest path problem
- Batch scheduling to minimize total completion time
- Designing optimal aviation baggage screening strategies using simulated annealing
- scientific article; zbMATH DE number 3694968 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 10435 (Why is no real title available?)
- Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Lagrangian relaxation and enumeration for solving constrained shortest-path problems
- Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
- Minimizing sum of completion times on a single machine with sequence-dependent family setup times
- Minimizing the number of late jobs in a stochastic setting using a chance constraint
- Minimizing the number of tardy jobs with stochastically-ordered processing times
- Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
- Near-shortest and K-shortest simple paths
- On the Complexity of Scheduling with Batch Setup Times
- On the robust single machine scheduling problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Resource-Constrained Assignment Scheduling
- Robust discrete optimization and its applications
- Robust Optimization of Large-Scale Systems
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Scheduling a flowline manufacturing cell with sequence dependent family setup times
- Scheduling Groups of Jobs on a Single Machine
- Simulated annealing heuristics for the dynamic facility layout problem
- Single facility multi-class job scheduling
- Single facility scheduling with multiple job classes
- Stochastic scheduling to minimize expected maximum lateness
- The shortest path problem with two objective functions
Cited in
(49)- Scheduling with uncertain durations: Modeling \(\beta \)-robust scheduling with constraints
- Distributionally robust single machine scheduling with the total tardiness criterion
- Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios
- Robust single machine scheduling with a flexible maintenance activity
- Distributionally robust single machine scheduling with risk aversion
- Stochastic single machine scheduling problem as a multi-stage dynamic random decision process
- Speed-robust scheduling. Sand, bricks, and rocks
- Scheduling in multi-scenario environment with an agreeable condition on job processing times
- Target-based distributionally robust optimization for single machine scheduling
- Parameterized multi-scenario single-machine scheduling problems
- Scheduling jobs with normally distributed processing times on parallel machines
- Single machine scheduling problem with interval processing times and total completion time objective
- Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times
- A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
- Robust single machine makespan scheduling with release date uncertainty
- Exact solutions for the two-machine robust flow shop with budgeted uncertainty
- Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations
- A robust optimization approach for the unrelated parallel machine scheduling problem
- Robust optimization for the cyclic hoist scheduling problem
- Optimization of schedule stability and efficiency under processing time variability and random machine breakdowns in a job shop environment
- The third comprehensive survey on scheduling problems with setup times/costs
- Robust vertex p-center model for locating urgent relief distribution centers
- Integrated production scheduling and maintenance policy for robustness in a single machine
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
- Robust scheduling in a just-in-time single machine system with processing time uncertainty
- Robust scheduling in an advanced planning and scheduling environment
- Workshop scheduling using practical (inaccurate) data Part 3: A framework to integrate job releasing, routing and scheduling functions to create a robust predictive schedule
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Minimizing value-at-risk in single-machine scheduling
- Makespan minimization for flow-shop problems with transportation times and a single robot
- A stochastic approach for the single-machine scheduling problem to minimize total expected cost with client-dependent tardiness costs
- Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems
- Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry
- Single machine scheduling with release dates: a distributionally robust approach
- A state-of-the-art survey on multi-scenario scheduling
- Target-oriented robust satisficing models for the single machine scheduling problems with release time
- Robust scheduling in a two-machine re-entrant flow shop to minimise the value-at-risk of the makespan: branch-and-bound and heuristic algorithms based on Markovian activity networks and phase-type distributions
- Efficient solutions to the \(m\)-machine robust flow shop under budgeted uncertainty
- Reactive scheduling of uncertain jobs with maximum time lags
- Recoverable robust single machine scheduling with polyhedral uncertainty
- The minmax regret scheduling-location problem on trees with interval-data edge lengths
- Distributionally robust single machine scheduling with release and due dates over Wasserstein balls
- Feature-driven robust stochastic scheduling for printed circuit board assembly
- A robust two-machine flow-shop scheduling model with scenario-dependent processing times
- Optimality region for job permutation in single-machine scheduling with uncertain processing times
- A robust approach for the single machine scheduling problem
- Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times
- Algorithms and complexity analysis for robust single-machine scheduling problems
This page was built for publication: Robust scheduling on a single machine to minimize total flow time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762157)
