Pages that link to "Item:Q1991311"
From MaRDI portal
The following pages link to A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations (Q1991311):
Displaying 8 items.
- The third comprehensive survey on scheduling problems with setup times/costs (Q319774) (← links)
- Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures (Q1622791) (← links)
- Dispatching algorithm for production programming of flexible job-shop systems in the smart factory industry (Q1639306) (← links)
- Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect (Q1727266) (← links)
- Optimization study of three-stage assembly flowshop problem in pharmacy automation dispensing systems (Q2147094) (← links)
- A metric approach for scheduling problems with minimizing the maximum penalty (Q2245804) (← links)
- Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times (Q2290196) (← links)
- Shop scheduling in manufacturing environments: a review (Q6060656) (← links)
