Optimal control of a class of DEDS: Flow-shops with state-dependent processing times
From MaRDI portal
Publication:1314858
DOI10.1007/BF01439161zbMath0790.90046OpenAlexW2086075115MaRDI QIDQ1314858
Chelliah Skriskandarajah, Edouard Wagneur
Publication date: 23 June 1994
Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01439161
makespanmaximum latenessmaximum tardinessdiscrete event dynamic systemspermutation flow-shopBellman principlepredictive feedback control law
Related Items (6)
A variant of the permutation flow shop model with variable processing times ⋮ A concise survey of scheduling with time-dependent processing times ⋮ Total completion time in a two-machine flowshop with deteriorating tasks ⋮ Scheduling jobs with varying processing times ⋮ A closed-form solution for the optimal release times for the \(F2|\) deteriorating jobs \(|\sum w_{j}c_{j}\) problem ⋮ A review of TSP based approaches for flowshop scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- Linear and combinatorial optimization in ordered algebraic structures
- Moduloïds and pseudomodules. I: Dimension theory
- Minimax algebra
- Hierarchical Control Of The Two Processor Flow-Shop With State Dependent Processing Times: Complexity Analysis And Approximate Algorithms
- A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing
- Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation
- The two-machine permutation flow shop with state-dependent processing times
- The Effect Of Queue Discipline On The Capacity Of Oueues With Service Time Dependent On Waiting Times
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- On the Flow-Shop Sequencing Problem with No Wait in Process†
This page was built for publication: Optimal control of a class of DEDS: Flow-shops with state-dependent processing times
