%0 Journal Article
%T Flow-shop Scheduling Problem with Transportation Times and a Single Robot<br>带运输时间和自动机的流水作业排序问题的复杂性
%A Shi Ling
%A Wen Jun
%A <br>时凌
%A 文军
%J 数学物理学报(A辑)
%D 2008
%I 
%X The paper considers the problem of scheduling jobs in a three-machine flow-shop to minimize the makespan. Between the completion of an operation and the beginning of the next operation of the same job, there is a time lag, which we refer to it as the transportation time. All transportation times have to be done by a single robot, which can perform at most one transportation at a time. New complexity results are derived for special case.
%K Flow-shop scheduling problemzz
%K Transportation timezz
%K Robotzz
%K Complexityzz<br>流水作业排序问题
%K 运输时间
%K 自动机
%K 复杂性
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=4DB553CDB5F521D8C921082E5C95EC80&aid=370332F7B5F9BA7977BADE3C2B2A4018&yid=67289AFF6305E306&vid=D3E34374A0D77D7F&iid=94C357A881DFC066&sid=F131C0ADC94A25CF&eid=714E16F7CF56F343&journal_id=1003-3998&journal_name=数学物理学报(A辑)&referenced_num=0&reference_num=6