Resource allocation to minimize the makespan with multi-resource operations
From MaRDI portal
Cites work
- A genetic algorithm for the flexible job-shop scheduling problem
- An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem
- An improved genetic algorithm for the distributed and flexible job-shop scheduling problem
- An optimal online algorithm for fractional scheduling on uniform machines with three hierarchies
- Heuristics for online scheduling on identical parallel machines with two GoS levels
- Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
- Identical parallel machine scheduling with assurance of maximum waiting time for an emergency job
- Insertion techniques for static and dynamic resource-constrained project scheduling.
- Makespan minimization for two parallel machines with an availability constraint
- Minimizing makespan subject to minimum flowtime on two identical parallel machines
- Multi-resource shop scheduling with resource flexibility
- New multi-objective method to solve reentrant hybrid flow shop scheduling problem
- On-line scheduling on parallel machines to minimize the makespan
- Partitioning procedures for solving mixed-variables programming problems
- Scheduling two parallel machines with machine-dependent availabilities
- Unrelated parallel machine scheduling problem with special controllable processing times and setups
- Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
This page was built for publication: Resource allocation to minimize the makespan with multi-resource operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6950538)
