Pages that link to "Item:Q1814870"
From MaRDI portal
The following pages link to Heuristics for permutation flow shop scheduling with batch setup times (Q1814870):
Displaying 14 items.
- A new set of high-performing heuristics to minimise flowtime in permutation flowshops (Q337260) (← links)
- Flow shop batching and scheduling with sequence-dependent setup times (Q490328) (← links)
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
- An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal (Q1339130) (← 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)
- Family scheduling with batch availability in flow shops to minimize makespan (Q1743654) (← links)
- Heuristics for scheduling in a flow shop with multiple processors (Q1806647) (← links)
- A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times (Q1919357) (← links)
- Scheduling with batching: A review (Q1969826) (← links)
- On the application of insertion techniques for job shop problems with setup times (Q4497862) (← links)
- Flowshop-scheduling problems with makespan criterion: a review (Q5466734) (← links)
- A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times (Q5477730) (← links)
- Local search heuristics for two-stage flow shop problems with secondary criterion (Q5955475) (← links)