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

代价依赖于加工位置的单机排序情形
引用本文:刘珊珊,刘朝晖.代价依赖于加工位置的单机排序情形[J].医学教育探索,2015(5):725-728.
作者姓名:刘珊珊  刘朝晖
作者单位:华东理工大学理学院, 上海 200237,华东理工大学理学院, 上海 200237
基金项目:国家自然科学基金(11171106)
摘    要:对于客户代价依赖于加工位置而非整个工序的单机排序情形,每个客户在不同位置上的代价可以由一个代价矩阵来描述。给定一个排序情形,一个可行解包括最终采用的工序和相应的客户代价支付方案。本文研究最优工序下的客户代价支付方案,给出了有初始工序时的一个分配规则,以及无初始工序时通过指派博弈得到的支付方案。

关 键 词:排序情形  指派博弈  学习效应  支付方案
收稿时间:2014/5/16 0:00:00

Single Machine Sequencing Situations with Position-Based Costs
LIU Shan-shan and LIU Zhao-hui.Single Machine Sequencing Situations with Position-Based Costs[J].Researches in Medical Education,2015(5):725-728.
Authors:LIU Shan-shan and LIU Zhao-hui
Institution:School of Science, East China University of Science and Technology, Shanghai 200237, China and School of Science, East China University of Science and Technology, Shanghai 200237, China
Abstract:In this paper, we discuss single machine sequencing situations with position-based costs. For these sequencing situations, the costs of agents on different positions are given by a matrix. Solving a sequencing situation means choosing a final processing order and deciding the related payment scheme. We focus on the payment scheme under the optimal processing order. When there is an initial order we design a simple cost allocation rule, and without initial order we make the payment scheme by an assignment game.
Keywords:sequencing situation  assignment game  learning effects  payment scheme
点击此处可从《医学教育探索》浏览原始摘要信息
点击此处可从《医学教育探索》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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