A search method for optimal control of a flow shop system of traditional machines
From MaRDI portal
Publication:976446
DOI10.1016/j.ejor.2009.12.028zbMath1188.90119OpenAlexW2163971454MaRDI QIDQ976446
Publication date: 11 June 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/22238
Convex programming (90C25) Search theory (90B40) Deterministic scheduling theory in operations research (90B35)
Related Items
Receding horizon control of mixed line flow shop systems ⋮ Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A subgradient descent algorithm for optimization of initially controllable flow shop systems
- Considering manufacturing cost and scheduling performance on a CNC turning machine
- A survey of results for sequencing problems with controllable processing times
- A two-machine flow shop scheduling problem with controllable job processing times
- Modeling, analysis and optimal control of a class of hybrid systems
- An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times
- Proportionate flow shop with controllable processing times
- A survey of scheduling with controllable processing times
- Multicriteria scheduling
- A backward algorithm for computing optimal controls for single-stage hybrid manufacturing systems
- Forward decomposition algorithms for optimal control of a class of hybrid systems
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Optimization of a Flow Shop System of Initially Controllable Machines
- Service Time Optimization of Mixed-Line Flow Shop Systems
- An improved forward algorithm for optimal control of a class of hybrid systems
- Constrained Optimal Hybrid Control of a Flow Shop System
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions