Généralisation Max-Plus des bornes de Lageweg, Lenstra et Rinnooy Kan
From MaRDI portal
Publication:5479832
DOI10.1051/ro:2004006zbMath1092.90024OpenAlexW2087451137MaRDI QIDQ5479832
Jean-Louis Bouquard, Christophe Lenté
Publication date: 11 July 2006
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=RO_2003__37_4_273_0
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A study of the cyclic scheduling problem on parallel processors
- Two-machine flowshop group scheduling problem
- Sequencing n Jobs on Two Machines with Arbitrary Time Lags
- Optimal two- and three-stage production schedules with setup times included
- A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- The Complexity of Flowshop and Jobshop Scheduling
- Lot Streaming in a Two-stage Flow Shop with Set-up, Processing and Removal Times Separated
- Modeling and analysis of timed Petri nets using heaps of pieces
- Sequencing n jobs on two machines with setup, processing and removal times separated
- Matrices Over Ordered Algebraic Structures
This page was built for publication: Généralisation Max-Plus des bornes de Lageweg, Lenstra et Rinnooy Kan
