Pages that link to "Item:Q3156753"
From MaRDI portal
The following pages link to Flow-shop batch scheduling with identical processing-time jobs (Q3156753):
Displaying 16 items.
- Flow shop batching and scheduling with sequence-dependent setup times (Q490328) (← links)
- A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups (Q490356) (← links)
- Batch scheduling on two-machine flowshop with machine-dependent setup times (Q606172) (← links)
- A polynomial-time algorithm for a flow-shop batching problem with equal-length operations (Q657253) (← links)
- Scheduling a hybrid flowshop with batch production at the last stage (Q875417) (← links)
- Batching and scheduling in a multi-machine flow shop (Q954247) (← links)
- Batch-scheduling problems to minimize actual flow times of parts through the shop under JIT environment (Q1328578) (← links)
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size (Q1596947) (← 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)
- A note on flow-shop and job-shop batch scheduling with identical processing-time jobs (Q1887796) (← links)
- Solving the serial batching problem in job shop manufacturing systems (Q1926815) (← links)
- Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop (Q2044553) (← links)
- A survey of scheduling problems with setup times or costs (Q2467249) (← links)
- Open-shop batch scheduling with identical jobs (Q2467272) (← links)
- A note on batch scheduling on a two-machine flowshop with machine-dependent processing times (Q6054015) (← links)
