Makespan minimization in machine dominated flowshop
From MaRDI portal
(Redirected from Publication:708144)
Recommendations
Cites work
- A note on flow shop scheduling problems with a learning effect on no-idle dominant machines
- Erratum to: ``A note on flow shop scheduling problems with a learning effect on no-idle dominant machines by M. Cheng et al.
- Flow shop scheduling problems with decreasing linear deterioration under dominant machines
- Flow shop scheduling problems with deteriorating jobs under dominating machines
- Flow-shops with a dominant machine
- Flowshop scheduling with dominant machines
- Makespan distribution of permutation flowshop schedules
- No-wait or no-idle permutation flowshop scheduling with dominating machines
- Nonpreemptive flowshop scheduling with machine dominance
- Optimal two- and three-stage production schedules with set-up time included
- Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time
- Scheduling
Cited in
(9)- Minimizing makespan in an ordered flow shop with machine-dependent processing times
- Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects
- Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
- Reduction of permutation flowshop problems to single machine problems using machine dominance relations
- Reducing network and computation complexities in neural based real-time scheduling scheme
- Makespan minimization for flow-shop problems with transportation times and a single robot
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
- Nonpreemptive flowshop scheduling with machine dominance
- Flowshop scheduling with dominant machines
This page was built for publication: Makespan minimization in machine dominated flowshop
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708144)