Pages that link to "Item:Q1290646"
From MaRDI portal
The following pages link to Approximation algorithms for two-machine flow shop scheduling with batch setup times (Q1290646):
Displaying 19 items.
- Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic (Q709121) (← links)
- A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times (Q1046715) (← links)
- Time complexity and linear-time approximation of the ancient two-machine flow shop (Q1268836) (← links)
- Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine (Q1290647) (← links)
- One-operator-two-machine flowshop scheduling with setup and dismounting times (Q1302722) (← links)
- Group technology approach to the open shop scheduling problem with batch setup times (Q1577474) (← links)
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size (Q1596947) (← links)
- Two-machine flowshop batching and scheduling (Q1772969) (← links)
- Heuristics for permutation flow shop scheduling with batch setup times (Q1814870) (← links)
- Unbounded parallel-batch scheduling with family jobs and delivery coordination (Q1944952) (← links)
- Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times (Q1968586) (← links)
- Scheduling with batching: A review (Q1969826) (← links)
- Integrated problem of soaking pit heating and hot rolling scheduling in steel plants (Q2003439) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Scheduling batches with sequential job processing for two-machine flow and open shops (Q2884499) (← links)
- Batch scheduling on a two-machine jobshop with machine-dependent setup times (Q2892129) (← links)
- An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer (Q4390594) (← links)
- A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines (Q5963694) (← links)
- A note on batch scheduling on a two-machine flowshop with machine-dependent processing times (Q6054015) (← links)