Timed event graph-based cyclic reconfigurable flow shop modelling and optimization
From MaRDI portal
Publication:5444453
DOI10.1080/00207540600693036zbMath1128.90429OpenAlexW2118022805MaRDI QIDQ5444453
De Xu, Sicheng Ren, Fang Wang, Min Tan
Publication date: 25 February 2008
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540600693036
Cites Work
- Performance evaluation of concurrent systems using Petri nets
- The complexity of scheduling jobs in repetitive manufacturing systems
- Marked directed graphs
- Feasibility study of the tactical design justification for reconfigurable manufacturing systems using the fuzzy analytical hierarchical process
- Performance evaluation of job-shop systems using timed event-graphs
- Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets
- Properties and performance bounds for timed marked graphs
- The Complexity of Flowshop and Jobshop Scheduling
- On some LP problems for performance evaluation of timed marked graphs
- Cyclic Scheduling of Identical Parts in a Robotic Cell
- Improving the supply chain performance: Use of forecasting models versus early order commitments
- A stochastic model of a reconfigurable manufacturing system Part 1: A framework
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
This page was built for publication: Timed event graph-based cyclic reconfigurable flow shop modelling and optimization