A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM
From MaRDI portal
Publication:3430322
DOI10.1142/S0217595907001036zbMath1137.90491OpenAlexW2085034949MaRDI QIDQ3430322
Shijie Sun, Longmin He, Run-Zi Luo
Publication date: 21 March 2007
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595907001036
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)
Related Items (4)
Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ A two-stage hybrid flow shop with dedicated machines at the first stage ⋮ Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage ⋮ Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines
Cites Work
- A branch and bound algorithm for the two-stage assembly scheduling problem
- The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine
- Two-stage flowshop scheduling with a common second-stage machine
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
- A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
- Optimal two- and three-stage production schedules with setup times included
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- The Complexity of Flowshop and Jobshop Scheduling
- Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
- The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
- Scheduling batches with simultaneous job processing for two-machine shop problems
This page was built for publication: A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM