Pages that link to "Item:Q3429035"
From MaRDI portal
The following pages link to Tight bounds for the identical parallel machine scheduling problem (Q3429035):
Displaying 14 items.
- An optimization-based heuristic for the machine reassignment problem (Q338859) (← links)
- Bee colony optimization for scheduling independent tasks to identical processors (Q519106) (← links)
- A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules (Q742501) (← links)
- A characterization of optimal multiprocessor schedules and new dominance rules (Q830925) (← links)
- Partial solutions and multifit algorithm for multiprocessor scheduling (Q894528) (← links)
- Maximizing the minimum completion time on parallel machines (Q1029565) (← links)
- Heuristics and exact methods for number partitioning (Q1038378) (← links)
- Ergonomic workplace design in the fast pick area (Q1642056) (← links)
- Improved algorithms to minimize workload balancing criteria on identical parallel machines (Q1652586) (← links)
- Minimizing the maximal ergonomic burden in intra-hospital patient transportation (Q1734337) (← links)
- Iterated greedy algorithms for a complex parallel machine scheduling problem (Q2116861) (← links)
- Tight bounds for the identical parallel machine‐scheduling problem: Part II (Q3502134) (← links)
- A simulation‐based differential evolution algorithm for stochastic parallel machine scheduling with operational considerations (Q5416762) (← links)
- Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods (Q6090983) (← links)
