The maximum deviation just-in-time scheduling problem

被引：19

作者：

Brauner, N

Crama, Y

机构：

[1] Imag Lab Grenoble, Lab Leibniz, F-38031 Grenoble, France

[2] Univ Liege, Ecole Adm Affaires, B-4000 Cointe Ougree, Belgium

来源：

DISCRETE APPLIED MATHEMATICS | 2004年 / 134卷 / 1-3期

基金：

美国国家科学基金会; 加拿大自然科学与工程研究理事会;

关键词：

scheduling; sequencing; just-in-time; high multiplicity; convex graphs; balanced words;

D O I：

10.1016/S0166-218X(03)00222-1

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

This note revisits the maximum deviation just-in-time (MDJIT) scheduling problem previously investigated by Steiner and Yeomans. Its main result is a set of algebraic necessary and sufficient conditions for the existence of a MDJIT schedule with a given objective function value. These conditions are used to provide a finer analysis of the complexity of the MDJIT problem. The note also investigates various special cases of the MDJIT problem and suggests several questions for further investigation. (C) 2003 Elsevier B.V. All rights reserved.

引用

页码：25 / 50

页数：26

共 29 条

[1] Balanced sequences and optimal routing [J].