Pages that link to "Item:Q2433392"
From MaRDI portal
The following pages link to An approximate decomposition algorithm for scheduling on parallel machines with heads and tails (Q2433392):
Displaying 12 items.
- An optimization-based heuristic for the machine reassignment problem (Q338859) (← links)
- Bounding strategies for the hybrid flow shop scheduling problem (Q545969) (← links)
- A simulated annealing approach to minimize the maximum lateness on uniform parallel machines (Q552090) (← links)
- Energetic reasoning revisited: Application to parallel machine scheduling (Q835610) (← links)
- Search tree based approaches for parallel machine scheduling (Q941538) (← links)
- A local and global search combine particle swarm optimization algorithm for job-shop scheduling to minimize makespan (Q1958785) (← links)
- Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness (Q2108098) (← links)
- Online scheduling on two parallel machines with release dates and delivery times (Q2355989) (← links)
- A prediction based iterative decomposition algorithm for scheduling large-scale job shops (Q2473277) (← links)
- Extra heads and invariant allocations (Q2497207) (← links)
- Online Scheduling on Two Parallel Machines with Release Times and Delivery Times (Q2867111) (← links)
- Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem (Q5086007) (← links)
