Pages that link to "Item:Q5943566"
From MaRDI portal
The following pages link to A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times (Q5943566):
Displaying 10 items.
- An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem (Q875429) (← links)
- Optimal and heuristic solution methods for a multiprocessor machine scheduling problem (Q1017458) (← links)
- Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays (Q1631999) (← links)
- Scheduling identical parallel machines with tooling constraints (Q1752870) (← links)
- Heuristic methods for the identical parallel machine flowtime problem with set-up times (Q1772875) (← links)
- A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time (Q1885972) (← links)
- Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach (Q2370333) (← links)
- A survey of scheduling problems with setup times or costs (Q2467249) (← links)
- A Multiobjective Optimization Approach to Solve a Parallel Machines Scheduling Problem (Q3083901) (← links)
- A hybrid heuristic approach to minimize number of tardy jobs in group technology systems (Q6066616) (← links)
