A makespan minimization problem for versatile developers in the game industry (Q6186551)

From MaRDI portal

Revision as of 19:16, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article; zbMATH DE number 7799065

Language	Label	Description	Also known as
English	A makespan minimization problem for versatile developers in the game industry	scientific article; zbMATH DE number 7799065

Statements

scholarly article

0 references

A makespan minimization problem for versatile developers in the game industry (English)

0 references

0 references

0 references

RAIRO - Operations Research

0 references

publication date

2 February 2024

0 references

zbMATH Keywords

job scheduling

0 references

game development

0 references

makespan

0 references

branch-and-bound algorithm

0 references

imperialist competitive algorithm

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1051/ro/2022191

0 references

Two parallel machine sequencing problems involving controllable job processing times

0 references

0 references

Stochastic weekly operating room planning with an exponential number of scenarios

0 references

Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach

0 references

0 references

Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times

0 references

A three-agent scheduling problem for minimizing the flow time on two machines

0 references

ABC-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times

0 references

Minimizing maximum tardiness on a single machine with family setup times and machine disruption

0 references

Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates

0 references

A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates

0 references

A new approximation algorithm for unrelated parallel machine scheduling with release dates

0 references

An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem

0 references

The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model

0 references

Minimizing makespan on a single burn-in oven in semiconductor manufacturing

0 references

A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs

0 references

A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals

0 references

A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1051/RO/2022191

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6186551

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6186551&oldid=39750983"