Metric and Approximated Solution of the Single Machine Total Tardiness Minimization Scheduling Problem

机译：单机总迟到最小化调度问题的度量和近似解

获取原文

页面导航

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

摘要

In this paper, we consider the NP-hard minimizing total tardiness on a single machine scheduling problem. We propose a metric for that problem and present a polynomial approximation scheme based on search for the polynomially solvable instance which has a minimal distance from an initial instance.

机译：在本文中，我们考虑了对单机调度问题的NP-COLLE最小化总迟到。我们提出了该问题的度量，并且基于从初始实例的距离最小距离的多项式溶解实例来呈现多项式近似方案。

著录项

来源
《IFAC Symposium on Information Control Problems in Manufacturing》|2012年||共4页
会议地点
作者
A. A. Lazarev; P. S. Korenev;
展开▼
作者单位

展开▼
会议组织
原文格式 PDF
正文语种
中图分类 TP273-53;
关键词
Scheduling algorithm; Total tardiness; Metric; Approximation scheme;

机译：调度算法;总迟到;度量;近似方案;

相似文献

外文文献
中文文献
专利

1. Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming [J] . Debora P. Ronconi, Warren B. Powell Journal of Scheduling . 2010,第6期

机译：使用近似动态规划，最大程度地减少随机单机调度问题中的总体延迟
2. New Solution Methods for Single Machine Bicriteria Scheduling Problems: Minimizing the Total Flowtime and Maximum Tardiness with Zero Release Dates [J] . Saheed Akande International journal of engineering research in Africa . 2018,第期

机译：单机双标准计划问题的新解决方法：以零发布日期最小化总流程时间和最大延迟
3. Online heuristic for the preemptive single machine scheduling problem to minimize the total weighted tardiness [J] . Boris Goldengorin, Vadim Romanuke Computers & Industrial Engineering . 2021,第May期

机译：在线启发式抢先的单机调度问题，以最大限度地减少总加权迟到
4. Metric and Approximated Solution of the Single Machine Total Tardiness Minimization Scheduling Problem [C] . A. A. Lazarev, P. S. Korenev IFAC Symposium on Information Control Problems in Manufacturing . 2012

机译：单机总迟到最小化调度问题的度量和近似解
5. A heuristic scheduling procedure to minimize the total tardiness on a single machine with sequence-dependent setup time. [D] . Dong, Yao-Hsiang. 2012

机译：启发式调度程序，可最大程度地减少一台机器上的总拖延时间，其顺序取决于设置时间。
6. Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents [O] . Wen-Chiung Lee, Yau-Ren Shiau, Yu-Hsiang Chung, -1

机译：具有两个竞争代理的单机调度可最大程度地减少总完成时间和拖延时间
7. Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming [O] . RONCONI, Debora P., POWELL, Warren B. 2010

机译：使用近似动态规划，最大程度地减少随机单机调度问题中的总体延迟
8. A Hybrid Algorithm for the One Machine Sequencing Problem to Minimize Total Tardiness [R] . inivasan, V. 1970

机译：一种最小化总延迟的单机排序问题的混合算法

Metric and Approximated Solution of the Single Machine Total Tardiness Minimization Scheduling Problem

摘要

著录项

相似文献

相关主题

期刊订阅