Identical-machines scheduling
id:
identical-machines-scheduling-202-3478948
title:
Identical-machines scheduling
text:
Identical-machines scheduling is an optimization problem in computer science and operations research. We are given n jobs J1, J2, ..., Jn of varying processing times, which need to be scheduled on m identical machines, such that a certain objective function is optimized, for example, the makespan is minimized. Identical machine scheduling is a special case of uniform machine scheduling, which is itself a special case of optimal job scheduling. In the general case, the processing time of each job
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Identical-machines_scheduling
date created:
date modified:
2023-12-16T12:05:46Z
main entity:
{"identifier":"Q107419135","url":"https://www.wikidata.org/entity/Q107419135"}
image:
fields total:
13
integrity:
13