Total flow time minimization in a flowshop sequence-dependent group scheduling problem
DOI10.1016/J.COR.2009.04.013zbMATH Open1171.90407OpenAlexW1980973321MaRDI QIDQ733546FDOQ733546
Authors: Nasser Salmasi, Rasaratnam Logendran, Mohammad Reza Skandari 
Publication date: 16 October 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.04.013
Recommendations
- Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem
- A hybrid metaheuristic approach for minimizing the total flow time in a flow shop sequence dependent group scheduling problem
- A flexible flowshop problem with total flow time minimization
- General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach
- A new encoding scheme-based hybrid algorithm for minimising two-machine flow-shop group scheduling problem
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Selected Topics in Column Generation
- Branch-and-price: Column generation for solving huge integer programs
- A survey of scheduling problems with setup times or costs
- The Complexity of Flowshop and Jobshop Scheduling
- A technical review of column generation in integer programming
- Scheduling a flowline manufacturing cell with sequence dependent family setup times
- Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups
Cited In (13)
- Group scheduling in a two-stage flowshop
- New effective MILP models for PFSPs arising from real applications
- A new encoding scheme-based hybrid algorithm for minimising two-machine flow-shop group scheduling problem
- The third comprehensive survey on scheduling problems with setup times/costs
- A comprehensive review of flowshop group scheduling literature
- Scheduling jobs families with learning effect on the setup
- Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem
- Energy-aware production scheduling in the flow shop environment under sequence-dependent setup times, group scheduling and renewable energy constraints
- When serial batch scheduling involves parallel batching decisions: a branch and price scheme
- Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates
- A hybrid metaheuristic approach for minimizing the total flow time in a flow shop sequence dependent group scheduling problem
- An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes
- An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem
Uses Software
This page was built for publication: Total flow time minimization in a flowshop sequence-dependent group scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733546)
