Scheduling with parallel processors and linear delay costs
From MaRDI portal
Cited in
(12)- Minimizing the number of tardy jobs for m parallel machines
- A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems
- Scheduling identical parallel machines to minimize total weighted completion time
- Heuristic methods for the identical parallel machine flowtime problem with set-up times
- On the minimization of total weighted flow time with identical and uniform parallel machines
- Heuristic methods and applications: A categorized survey
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
- An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime
- Matching based very large-scale neighborhoods for parallel machine scheduling
- An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines
- A state-of-the-art review of parallel-machine scheduling research
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
This page was built for publication: Scheduling with parallel processors and linear delay costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5181071)
