Pages that link to "Item:Q1318519"
From MaRDI portal
The following pages link to A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective (Q1318519):
Displayed 13 items.
- A composite algorithm for multiprocessor scheduling (Q544815) (← links)
- Minimizing the makespan in nonpreemptive parallel machine scheduling problem (Q655176) (← links)
- Partial solutions and multifit algorithm for multiprocessor scheduling (Q894528) (← links)
- Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint (Q1009206) (← links)
- List scheduling algorithms to minimize the makespan on identical parallel machines (Q1348708) (← links)
- The longest processing time rule for identical parallel machines revisited (Q2173053) (← links)
- Heuristics for online scheduling on identical parallel machines with two GoS levels (Q2320626) (← links)
- Improved approaches to the exact solution of the machine covering problem (Q2398644) (← links)
- An exact algorithm for parallel machine scheduling with conflicts (Q2400043) (← links)
- Minimizing labor requirements in a periodic vehicle loading problem (Q2490369) (← links)
- Tight bounds for the identical parallel machine scheduling problem (Q3429035) (← links)
- Tight bounds for the identical parallel machine‐scheduling problem: Part II (Q3502134) (← links)
- Machine scheduling models in environmentally focused chemical manufacturing (Q4230056) (← links)