Pages that link to "Item:Q5181071"
From MaRDI portal
The following pages link to Scheduling with parallel processors and linear delay costs (Q5181071):
Displaying 12 items.
- Matching based very large-scale neighborhoods for parallel machine scheduling (Q415566) (← links)
- A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
- Minimizing the number of tardy jobs for \(m\) parallel machines (Q1127174) (← links)
- A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems (Q1310018) (← links)
- Scheduling identical parallel machines to minimize total weighted completion time (Q1317043) (← links)
- Heuristic methods for the identical parallel machine flowtime problem with set-up times (Q1772875) (← links)
- On the minimization of total weighted flow time with identical and uniform parallel machines (Q1806644) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (Q1945095) (← links)
- An improved branching scheme for the branch and bound procedure of scheduling<i>n</i>jobs on<i>m</i>parallel machines to minimize total weighted flowtime (Q3783064) (← links)
- An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines (Q5696463) (← links)
