Pages that link to "Item:Q1652033"
From MaRDI portal
The following pages link to 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):
Displayed 10 items.
- Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study (Q1651526) (← 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)
- An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems (Q2093186) (← links)
- Mathematical modeling for a \(p\)-mobile hub location problem in a dynamic environment by a genetic algorithm (Q2295062) (← links)
- A new model and algorithm for uncertain random parallel machine scheduling problem (Q2318555) (← links)
- Just-in-time scheduling for a distributed concrete precast flow shop system (Q2668621) (← links)
- Auxiliary resource planning in a flexible flow shop scheduling problem considering stage skipping (Q2669726) (← links)
- Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost (Q6105902) (← links)
- A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization (Q6114940) (← links)
- Learning-augmented heuristics for scheduling parallel serial-batch processing machines (Q6164322) (← links)
