Flow-shop scheduling
id:
flow-shop-scheduling-290-11838665
title:
Flow-shop scheduling
text:
Flow-shop scheduling 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 flow-shop scheduling, each job contains exactly m operations. The i-th operation of
brand slug:
wiki
category slug:
encyclopedia
description:
Class of computational problem
original url:
https://en.wikipedia.org/wiki/Flow-shop_scheduling
date created:
date modified:
2023-11-23T08:52:18Z
main entity:
{"identifier":"Q3074426","url":"https://www.wikidata.org/entity/Q3074426"}
image:
fields total:
13
integrity:
14