Pages that link to "Item:Q490328"
From MaRDI portal
The following pages link to Flow shop batching and scheduling with sequence-dependent setup times (Q490328):
Displaying 15 items.
- Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions (Q398878) (← links)
- Facility layout based on sequence analysis: design of flowshops (Q615282) (← links)
- Decomposition methods for reentrant flow shops with sequence-dependent setup times (Q1579123) (← links)
- Scheduling a flowline manufacturing cell with sequence dependent family setup times (Q1580980) (← links)
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size (Q1596947) (← links)
- A comprehensive review of flowshop group scheduling literature (Q1651625) (← links)
- An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes (Q1652033) (← links)
- Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times (Q1694317) (← links)
- Family scheduling with batch availability in flow shops to minimize makespan (Q1743654) (← links)
- Heuristics for permutation flow shop scheduling with batch setup times (Q1814870) (← links)
- Solving the serial batching problem in job shop manufacturing systems (Q1926815) (← links)
- An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems (Q2093186) (← links)
- Sequencing and scheduling in flowshops with task redistribution (Q4658528) (← links)
- Sequencing CONWIP flow-shops: Analysis and heuristics (Q4674420) (← links)
- A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence-Dependent Setups (Q4896444) (← links)
