Minimizing Makespan on Parallel Machines with Machine Eligibility Restrictions
From MaRDI portal
Recommendations
- Minimizing makespan on parallel machines with release time and machine eligibility restrictions
- Minimising makespan on parallel machines with precedence constraints and machine eligibility restrictions
- Parallel machine makespan minimization subject to machine availability and total completion time constraints
- Makespan minimization subject to flowtime optimality on identical parallel machines
- Minimizing makespan subject to minimum total flow-time on identical parallel machines
- Makespan minimization for parallel machines scheduling with multiple availability constraints
- Makespan minimization for two parallel machines with an availability constraint
- Minimizing the makespan in nonpreemptive parallel machine scheduling problem
- Minimizing makespan subject to minimum flowtime on two identical parallel machines
- Exact makespan minimization of unrelated parallel machines
Cited in
(7)- Minimizing makespan subject to minimum total flow-time on identical parallel machines
- Discrete parallel machine makespan ScheLoc problem
- Makespan minimization subject to flowtime optimality on identical parallel machines
- Auxiliary resource planning in a flexible flow shop scheduling problem considering stage skipping
- Minimising makespan on parallel machines with precedence constraints and machine eligibility restrictions
- Identical parallel machine rescheduling under complex restrictions
- Minimizing the makespan in nonpreemptive parallel machine scheduling problem
This page was built for publication: Minimizing Makespan on Parallel Machines with Machine Eligibility Restrictions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192848)
