A heuristic method for two-stage hybrid flow shop with dedicated machines
From MaRDI portal
Publication:339604
DOI10.1016/J.COR.2012.07.015zbMATH Open1349.90413OpenAlexW2064193520MaRDI QIDQ339604FDOQ339604
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.07.015
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- The hybrid flow shop scheduling problem
- Title not available (Why is that?)
- Total completion time minimization in a \(2\)-stage differentiation flowshop with fixed sequences per job type
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- Modeling realistic hybrid flexible flowshop scheduling problems
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Optimal scheduling of a two-stage hybrid flow shop
- Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times
- Minimum weighted number of tardy jobs on an \(m\)-machine flow-shop with a critical machine
- Scheduling a two-stage hybrid flow shop with parallel machines at the first stage
- Flow shop and open shop scheduling with a critical machine and two operations per job
- Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage
- Comments on Flow shop and open shop scheduling with a critical machine and two operations per job
- A note on the two-stage hybrid flow shop problem with dedicated machines
- Scheduling two-stage hybrid flow shop with availability constraints
- A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines
- Sequencing a hybrid two-stage flowshop with dedicated machines
- Minimizing total completion time in two-stage hybrid flow shop with dedicated machines
Cited In (17)
- Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping
- On the two-stage hybrid flow shop with dedicated machines
- A two-stage flow shop scheduling problem with transportation considerations
- Méthode heuristique pour le problème de flow shop hybride avec machines dédiées
- A comparison of priority rules for minimizing the maximum lateness in tree data gathering networks
- A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems
- Dispatching algorithm for production programming of flexible job-shop systems in the smart factory industry
- Scheduling a two stage proportionate flexible flow shop with dedicated machines and no buffers
- Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines
- Clarifying cutting and sewing processes with due windows using an effective ant colony optimization
- A note on ``A heuristic method for two-stage hybrid flow shop with dedicated machines
- A two-stage hybrid flow shop with dedicated machines at the first stage
- Exact resolution of the two-stage hybrid flow shop with dedicated machines
- Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time
- Hybrid flow shop scheduling with not-all-machines options via local search with controlled deterioration
- Heuristic algorithms for two machine re-entrant flow shop
- A note on the two-stage hybrid flow shop problem with dedicated machines
This page was built for publication: A heuristic method for two-stage hybrid flow shop with dedicated machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339604)
