The maximum deviation just-in-time scheduling problem

Authors:
N. Brauner;Y. Crama
Affiliations:
Laboratoire Leibniz-IMAG, 46 avenue Félix Viallet, Grenoble cedex F-38031, France;Ecole d'Administration des Affaires, University of Liège, Bld. du Rectorat 7 (B31), Liège 4000, Belgium
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 8
Cited 7

Level schedules for mixed-model assembly lines in just-in-time production systems

Management Science
A note on “level schedules for mixed-model assembly lines in just-in-time production systems”

Management Science
Sequencing JIT mixed-model assembly lines

Management Science
Level schedules for mixed-model, Just-in-Time processes

Management Science
Balanced sequences and optimal routing

Journal of the ACM (JACM)
Fraenkel's conjecture for six sequences

Discrete Mathematics
Graph Theory With Applications

Graph Theory With Applications
A simple approach to the product rate variation problem via axiomatics

Operations Research Letters

Solution of The Liu-Layland Problem Via Bottleneck Just-In-Time Sequencing

Journal of Scheduling
Solving the minmax product rate variation problem (PRVP)as a bottleneck assignment problem

Computers and Operations Research
Matrix approximation and Tusnády's problem

European Journal of Combinatorics
Integer matrices with constraints on leading partial row and column sums

Discrete Applied Mathematics
Unbiased matrix rounding

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Rounding of sequences and matrices, with applications

WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Note: Job release scheduling problem: Complexity and an approximation algorithm

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

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 MDJTT problem. The note also investigates various special cases of the MDJIT problem and suggests several questions for further investigation.