A makespan minimization problem for versatile developers in the game industry
From MaRDI portal
Recommendations
- Algorithms for solving minimax scheduling problem
- Optimal scheduling in film production to minimize talent hold cost
- Two-person cooperative games on makespan scheduling
- Some algorithms of solving minimax multiprocessor scheduling problem
- Games, Critical Paths and Assignment Problems in Permutation Flow Shops and Cyclic Scheduling Flow Line Environments
Cites work
- A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs
- A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
- A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects
- A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
- A new approximation algorithm for unrelated parallel machine scheduling with release dates
- A three-agent scheduling problem for minimizing the flow time on two machines
- ABC-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times
- An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
- Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
- scientific article; zbMATH DE number 4104743 (Why is no real title available?)
- Introduction to algorithms.
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- Minimizing maximum tardiness on a single machine with family setup times and machine disruption
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
- Stochastic weekly operating room planning with an exponential number of scenarios
- The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model
- Two parallel machine sequencing problems involving controllable job processing times
Cited in
(1)
This page was built for publication: A makespan minimization problem for versatile developers in the game industry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6186551)
