Flow-shop scheduling (original) (raw)
Le flow-shop est un problème de la théorie de l'ordonnancement, un domaine de la recherche opérationnelle et de l'algorithmique.
| Property | Value |
|---|---|
| dbo:abstract | 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 (that is, when all the jobs have finished processing). In the specific variant known as flow-shop scheduling, each job contains exactly m operations. The i-th operation of the job must be executed on the i-th machine. No machine can perform more than one operation simultaneously. For each operation of each job, execution time is specified. Flow-shop scheduling is a special case of job-shop scheduling where there is strict order of all operations to be performed on all jobs. Flow-shop scheduling may apply as well to production facilities as to computing designs. A special type of flow-shop scheduling problem is the permutation flow-shop scheduling problem in which the processing order of the jobs on the resources is the same for each subsequent step of processing. In the standard three-field notation for optimal-job-scheduling problems, the flow-shop variant is denoted by F in the first field. For example, the problem denoted by " F3| |
| dbo:wikiPageID | 21544094 (xsd:integer) |
| dbo:wikiPageLength | 6613 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1070079719 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Open-shop_scheduling dbr:Process_(engineering) dbr:Behnam_Malakooti dbr:Branch_and_bound dbr:Genetic_algorithm dbr:Optimal_job_scheduling dbr:Computer_science dbr:Computing dbr:Makespan dbc:Optimal_scheduling dbr:Job-shop_scheduling dbc:Workflow_technology dbr:Operations_Research dbr:Optimization_problem dbr:Manufacturing dbr:Johnson's_Rule dbr:Exact_algorithm dbr:Heuristic_algorithm |
| dbp:wikiPageUsesTemplate | dbt:Reflist dbt:Short_description dbt:Scheduling_problems |
| dct:subject | dbc:Optimal_scheduling dbc:Workflow_technology |
| rdfs:comment | Le flow-shop est un problème de la théorie de l'ordonnancement, un domaine de la recherche opérationnelle et de l'algorithmique. (fr) Задача планування для потокової лінії (англ. flow shop scheduling problem або permutation flowshop scheduling) — комбінаторна задача теорії розкладів. (uk) 流水线调度（英語：Flow-shop scheduling）是计算机科学及运筹学中的一个最佳化問題，是最优作业调度的一个变体。在一般的作业调度问题中，我们有从到这n个工作，每项工作都具有不同的完成时间。我们需要做的是最小化加工周期，也就是完成所有工作所用的时间。而在流水线调度的问题中，每项工作都需要经过m道工序，且第i道工序必须在第i台机器上完成，每台机器在同一时间最多去完成一项任务。 流水线调度是一种特殊的，所有的工作都必须按照严格的时间顺序进行。该调度模式不仅适用于生产规划，同时也适用于计算设计。排列流水线调度问题是流水线调度问题的一种特殊类型，在排列流水线调度问题中，所有工作在每道工序上的完成顺序是相同的。 在最优作业调度问题的标准三字段表示法中，流水线调度在第一个字段中用F表示。例如用于表示三机流水线调度问题，每项工作在每道工序都有自己的加工时间，目标是最小化使最大完成时间。 (zh) Задача планирования для поточной линии (англ. flow shop scheduling problem или permutation flowshop scheduling) — комбинаторная задача теории расписаний. (ru) 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 (that is, when all the jobs have finished processing). In the specific variant known as flow-shop scheduling, each job contains exactly m operations. The i-th operation of the job must be executed on the i-th machine. No machine can perform more than one operation simultaneously. For each operation of each job, execution time is specified. (en) |
| rdfs:label | Flow-shop scheduling (en) Flow-shop (fr) Задача планирования для поточной линии (ru) 流水线调度 (zh) Задача планування для потокової лінії (uk) |
| owl:sameAs | wikidata:Flow-shop scheduling dbpedia-fr:Flow-shop scheduling dbpedia-ru:Flow-shop scheduling dbpedia-uk:Flow-shop scheduling dbpedia-zh:Flow-shop scheduling https://global.dbpedia.org/id/2rN2p |
| prov:wasDerivedFrom | wikipedia-en:Flow-shop_scheduling?oldid=1070079719&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:Flow-shop_scheduling |
| is dbo:wikiPageRedirects of | dbr:Flow_shop_scheduling dbr:Flow_Shop_Scheduling_Problem dbr:Flow_Shop_Scheduling_problems |
| is dbo:wikiPageWikiLink of | dbr:Open-shop_scheduling dbr:Optimal_job_scheduling dbr:Job-shop_scheduling dbr:Flow_shop_scheduling dbr:Flow_Shop_Scheduling_Problem dbr:Flow_Shop_Scheduling_problems |
| is foaf:primaryTopic of | wikipedia-en:Flow-shop_scheduling |