Pages that link to "Item:Q1604067"
From MaRDI portal
The following pages link to Nonpreemptive flowshop scheduling with machine dominance (Q1604067):
Displaying 8 items.
- Flowshop scheduling problems with a position-dependent exponential learning effect (Q474618) (← links)
- Makespan minimization in machine dominated flowshop (Q708144) (← links)
- Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time (Q861201) (← links)
- Flow shop scheduling problems with decreasing linear deterioration under dominant machines (Q868141) (← links)
- Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling (Q870153) (← links)
- A note on flow shop scheduling problems with a learning effect on no-idle dominant machines (Q879575) (← links)
- Reduction of permutation flowshop problems to single machine problems using machine dominance relations (Q1652025) (← links)
- No-wait or no-idle permutation flowshop scheduling with dominating machines (Q1767400) (← links)