Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem
From MaRDI portal
Publication:2341222
DOI10.1007/s10479-014-1667-6zbMath1309.90027OpenAlexW2010510434MaRDI QIDQ2341222
Taha Keshavarz, Nasser Salmasi, Mohsen Varmazyar
Publication date: 23 April 2015
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-014-1667-6
lower boundmemetic algorithmgroup schedulingsequence-dependent setup timeflexible flowshopbranch and price algorithm
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Joint optimization of preventive maintenance and flexible flowshop sequence-dependent group scheduling considering multiple setups, The third comprehensive survey on scheduling problems with setup times/costs, A comprehensive review of flowshop group scheduling literature, When serial batch scheduling involves parallel batching decisions: a branch and price scheme, Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Total flow time minimization in a flowshop sequence-dependent group scheduling problem
- Group-scheduling problems in electronics manufacturing
- Periodic solutions for generalized high-order neutral differential equation in the critical case
- Scheduling a flowline manufacturing cell with sequence dependent family setup times
- Parallel hybrid heuristics for the permutation flow shop problem
- Recent advances in memetic algorithms.
- A technical review of column generation in integer programming
- Scheduling jobs on a \(k\)-stage flexible flow-shop
- Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Scheduling
