Open-shop scheduling
id:
open-shop-scheduling-319-9075934
title:
Open-shop scheduling
text:
Open-shop scheduling or open-shop scheduling problem (OSSP) is an optimization problem in computer science and operations research. It is a variant of optimal job scheduling. In a general job-scheduling problem, we are given n jobs J1, J2, ..., Jn of varying processing times, which need to be scheduled on m machines with varying processing power, while trying to minimize the makespan - the total length of the schedule. In the specific variant known as open-shop scheduling, each job consists of a
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Open-shop_scheduling
date created:
date modified:
2023-03-27T09:15:13Z
main entity:
{"identifier":"Q7095711","url":"https://www.wikidata.org/entity/Q7095711"}
image:
fields total:
13
integrity:
13