A makespan minimization problem for versatile developers in the game industry
From MaRDI portal
Publication:6186551
DOI10.1051/ro/2022191OpenAlexW4307722287MaRDI QIDQ6186551
Publication date: 2 February 2024
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2022191
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- Unnamed Item
- Unnamed Item
- An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
- ABC-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times
- 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 for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs
- The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model
- A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
- Two parallel machine sequencing problems involving controllable job processing times
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
- A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
- A new approximation algorithm for unrelated parallel machine scheduling with release dates
- Minimizing maximum tardiness on a single machine with family setup times and machine disruption
- A three-agent scheduling problem for minimizing the flow time on two machines
- Stochastic weekly operating room planning with an exponential number of scenarios
This page was built for publication: A makespan minimization problem for versatile developers in the game industry