A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately
From MaRDI portal
Publication:5436247
DOI10.1007/s11741-007-0105-2zbMath1174.90467OpenAlexW2071404286MaRDI QIDQ5436247
Publication date: 14 January 2008
Published in: Journal of Shanghai University (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11741-007-0105-2
Cites Work
- Scheduling algorithms for flexible flowshops: Worst and average case performance
- On the exact upper bound for the Multifit processor scheduling algorithm
- Efficient scheduling algorithms for a single batch processing machine
- Minimizing makespan in hybrid flowshops
- Heuristic algorithms for the two-stage hybrid flowshop problem
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- Optimal two- and three-stage production schedules with setup times included
- Two-Stage, Hybrid Flowshop Scheduling Problem
- The Two-Stage Flowshop Scheduling Problem with M Machines at each Stage
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- An Application of Bin-Packing to Multiprocessor Scheduling
- The Complexity of Flowshop and Jobshop Scheduling
- Scheduling a single batch processing machine with non-identical job sizes
- Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage
- Bounds on Multiprocessing Timing Anomalies
- Scheduling batches with simultaneous job processing for two-machine shop problems
- Scheduling independent multiprocessor tasks
This page was built for publication: A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately
