Two-machine flowshop minimum-length scheduling problem with random and bounded processing times
From MaRDI portal
Recommendations
- Two-machine flow-shop minimum-length scheduling with interval processing times
- Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times
- Flowshop scheduling problem to minimize total completion time with random and bounded processing times
- Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times
- Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time
Cites work
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- Scheduling in stochastic flowshops with independent setup, processing and removal times
- Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function
- Stochastically minimizing the makespan in two-machine flow shops without blocking
- Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
- Two machine mixed shop scheduling problem with controllable machine speeds
- Two-machine ordered flowshop scheduling under random breakdowns
- Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
Cited in
(24)- The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph
- Mean flow time minimization with given bounds of processing times
- Two-machine stochastic flow shops with blocking and the traveling salesman problem
- A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
- A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times
- Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
- Two-machine flow-shop minimum-length scheduling with interval processing times
- Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times
- scientific article; zbMATH DE number 3974704 (Why is no real title available?)
- Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times
- Schedule execution for two-machine flow-shop with interval processing times
- Minimizing total weighted flow time of a set of jobs with interval processing times
- Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time
- Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm
- A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
- On Johnson's Two-Machine Flow Shop with Random Processing Times
- Johnson's problem with stochastic processing times and optimal service level
- Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times
- Minimizing total weighted completion time with uncertain data: a stability approach
- Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times
- Flowshop scheduling problem to minimize total completion time with random and bounded processing times
- Case study on statistically estimating minimum makespan for flow line scheduling problems.
This page was built for publication: Two-machine flowshop minimum-length scheduling problem with random and bounded processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4806914)
