Mean flow time minimization with given bounds of processing times
From MaRDI portal
Recommendations
- Flowshop scheduling problem to minimize total completion time with random and bounded processing times
- Two-machine flow-shop minimum-length scheduling with interval processing times
- Minimizing total weighted flow time of a set of jobs with interval processing times
- Optimal makespan scheduling with given bounds of processing times
- Two-machine flowshop minimum-length scheduling problem with random and bounded processing times
Cites work
- Current trends in deterministic scheduling
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 44978 (Why is no real title available?)
- scientific article; zbMATH DE number 764326 (Why is no real title available?)
- On the set of solutions of the open shop problem
- Optimal makespan scheduling with given bounds of processing times
- Scheduling computer and manufacturing processes
- Sequencing with uncertain numerical data for makespan minimisation
- Stability of a schedule minimizing mean flow time
- The Minimum Common-Cycle Algorithm for Cyclic Scheduling of Two Material Handling Hoists with Time Window Constraints
- Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
Cited in
(24)- Optimal makespan scheduling with given bounds of processing times
- The stability radius of an optimal line balance with maximum efficiency for a simple assembly line
- Minimizing total weighted flow time under uncertainty using dominance and a stability box
- Schedule execution for two-machine flow-shop with interval processing times
- A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines
- Uncertainty measure for the Bellman-Johnson problem with interval processing times
- Reliability analysis in presence of random variables and fuzzy variables
- 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
- Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times
- scientific article; zbMATH DE number 3850790 (Why is no real title available?)
- Two-machine flow-shop minimum-length scheduling with interval processing times
- Minimizing Average Flow-Time
- On Minimizing Flow Time on Processors with Variable Unit Processing Time
- Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
- Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
- An artificial bee colony algorithm for the job shop scheduling problem with random processing times
- Minimizing Mean Flow Time With Release Time and Deadline Constraints
- Minimizing Mean Completion Time for Special Flowshop Problems
- scientific article; zbMATH DE number 2079378 (Why is no real title available?)
- Algorithms for minimizing weighted flow time
- Minimizing total weighted completion time with uncertain data: a stability approach
- Group shops scheduling with makespan criterion subject to random release dates and processing times
- Stability polyhedra of optimal permutation of jobs servicing
This page was built for publication: Mean flow time minimization with given bounds of processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1887954)
