首页 | 本学科首页   官方微博 | 高级检索  
     


The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan
Authors:Alix Munier-Kordon  Djamal Rebaine
Affiliation:1. Laboratoire LIP6, Universite Pierre et Marie Curie, BC. 167, 4 place Jussieu, 75252, Paris Cedex 05, France;2. Departement d’informatique et de mathematique, Universite du Quebec a Chicoutimi, 555, boul. de PUniversite, Quebec, Canada G7H 2B1
Abstract:This paper addresses the problem of scheduling unit-time operations with integral and non-negative time delay considerations on a two-machine open-shop environment. The criterion to minimize is the makespan. Two well solvable cases and two approximation algorithms, with their worst-case analyses, are presented.
Keywords:Makespan   Open-shop   Time delays   Well solvable case   Worst-case analysis
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号