Sequencing jobs for an automated manufacturing module with buffer

DOI10.1016/S0377-2217(96)00115-4zbMath0917.90185OpenAlexW2062532474MaRDI QIDQ1278543

Ahmet Bolat

Publication date: 5 August 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00115-4

zbMATH Keywords

dynamic programmingheuristicblockingpolynomial timereal-time schedulingworst case error boundsautomated manufacturing modulelimited input buffer

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Flow-shop scheduling for three serial stations with the last two duplicate

Cites Work

• Unnamed Item
• Scheduling algorithms for flexible flowshops: Worst and average case performance
• Real-time scheduling of an automated manufacturing center
• Profit-based FMS dynamic part type selection over time for mid-term production planning
• The complexity of scheduling jobs in repetitive manufacturing systems
• Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
• A Variable Buffer-Size Model and Its Use in Analyzing Closed Queueing Networks with Blocking
• Optimal Scheduling of Products with Two Subassemblies on a Single Machine
• Decomposition for Scheduling Flexible Manufacturing Systems
• Batching and Scheduling in FMS Hubs: Flow Time Considerations
• On Decomposition Methods for Tandem Queueing Networks with Blocking

This page was built for publication: Sequencing jobs for an automated manufacturing module with buffer