The server is under maintenance between 08:00 to 12:00 (GMT+08:00), and please visit later.
We apologize for any inconvenience caused
Login  | Sign Up  |  Oriprobe Inc. Feed
China/Asia On Demand
Journal Articles
Laws/Policies/Regulations
Companies/Products
Bookmark and Share
Two-Machine Open Shop Scheduling with Machine-Dependent Processing Times
Author(s): 
Pages: 65-74
Year: Issue:  4
Journal: Operations Research Transactions

Abstract: 研究加工时间仅依赖于机器的两台机自由作业排序问题O2|pij=pi,p2<p1<2p2,Non-Idle|∑Cj.项思明和唐国春(1998)证明了可将该问题转化成指派问题.俞文鱿和应刚(1998)给出了这一问题的显式解,并用较长的篇幅证明其显式解的正确性;他们还举例说明所给出的显式最优排序并不排除其他形式的最优解的存在;但他们未说明所给出的显式解何时才是唯一最优解.将给出问题O2|pij=pi,p...
Related Articles
No related articles found