Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time

Authors:	Philippe?Baptiste author-information" > author-information__contact u-icon-before" > mailto:philippe.baptiste@polytechnique.fr" title=" philippe.baptiste@polytechnique.fr" itemprop=" email" data-track=" click" data-track-action=" Email author" data-track-label=" " >Email author,Vadim G.?Timkovsky

Affiliation:	(1) CNRS LIX, Ecole Polytechnique, F-91128, Palaiseau

Abstract:

Keywords:	Scheduling Parallel machine Flowshop Complexity
本文献已被 SpringerLink 等数据库收录！