Fixed-time schedules for the processing of jobs when service completions are not observable

Glazebrook KD; Punton EL

首页> 外文期刊>Mathematical methods of operations research >Fixed-time schedules for the processing of jobs when service completions are not observable

【24h】

Fixed-time schedules for the processing of jobs when service completions are not observable

机译：在无法观察到服务完成的情况下用于处理作业的固定时间表

获取原文

获取原文并翻译 | 示例

获取外文期刊封面封底 >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

We argue the importance of studying service systems in which the successful completion of job/customer service cannot be observed contemporaneously. Military and other applications are cited. The allocation of a large amount of processing to a job may make its (unobservable) successful completion more likely but will impose a burden on other jobs awaiting service. A fixed-time schedule specifies both the order in which jobs should be processed and how much processing each should receive. The goal is to find schedules which maximise the total expected reward earned from all jobs served. While this problem is intractable in general, a range of characterisations of optimal fixed-time schedules is achieved for given scenarios. The development of effective heuristics is also discussed.

机译：我们认为研究不能同时观察到工作/客户服务成功完成的服务系统的重要性。引用了军事和其他应用。将大量处理分配给一个作业可能使其（不可观察到的）成功完成的可能性更大，但将给其他等待服务的作业带来负担。固定时间的时间表指定了处理作业的顺序以及每个作业应接受的处理量。目标是找到时间表，以使从所服务的所有工作中获得的总预期奖励最大化。虽然此问题通常很难解决，但对于给定方案，可以实现一系列最佳固定时间表。还讨论了有效启发式方法的发展。

著录项

来源
《Mathematical methods of operations research》 |2005年第1期|共21页
作者
Glazebrook KD; Punton EL;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类数学;
关键词
Gittins index; restless bandit; stochastic dynamic programming; stochastic scheduling;

机译：Gittins指数;躁动匪徒;随机动态规划;随机调度;

相似文献

外文文献
中文文献
专利

1. Fixed-time schedules for the processing of jobs when service completions are not observable [J] . Glazebrook KD, Punton EL Mathematical methods of operations research . 2005,第1期

机译：在无法观察到服务完成的情况下用于处理作业的固定时间表
2. Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time [J] . Xu Zhijun, Xu Dehua Journal of Scheduling . 2018,第4期

机译：单机调度，具有与工作量相关的工具更换持续时间和相等的处理时间作业，以最大程度地减少总完成时间
3. Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function [J] . Nhan-Quy Nguyen, Yalaoui Farouk, Amodeo Lionel, Computers & operations research . 2018,第feba期

机译：具有作业线性处理率函数的时间窗约束下的机器调度问题的总完成时间最小化
4. On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time [C] . Bo Chen, Xiaotie Deng, Wenan Zang Algorithms and Computation . 2001

机译：在线调度批处理系统以最小化总加权作业完成时间
5. Composing business processes with partially observable problem spaces in a Web services environment. [D] . Liang, Yong. 2007

机译：在Web服务环境中，将业务流程与部分可观察到的问题空间合并在一起。
6. Scheduling Jobs with Variable Job Processing Times on Unrelated Parallel Machines [O] . Guang-Qian Zhang, Jian-Jun Wang, Ya-Jing Liu -1

机译：在不相关的并行机上调度具有可变作业处理时间的作业
7. Parallel-machine scheduling with controllable processing times and rate-modifying activities to minimise total cost involving total completion time and job compressions [O] . Yang DL, Cheng TCE, Yang SJ 2014

机译：具有可控制的处理时间和速率修改活动的并行机器调度，可将涉及总完成时间和工作压缩的总成本降至最低

Fixed-time schedules for the processing of jobs when service completions are not observable

摘要

著录项

相似文献

相关主题

期刊订阅