Total flow time minimization in a flowshop sequence-dependent group scheduling problem

DOI10.1016/J.COR.2009.04.013MaRDI QIDQ733546zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

metaheuristicslower boundgroup schedulingbranch and pricesequence dependent scheduling

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

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

Cites work

• scientific article; zbMATH DE number 956787 (Why is no real title available?)
• A survey of scheduling problems with setup times or costs
• A technical review of column generation in integer programming
• Branch-and-price: Column generation for solving huge integer programs
• Scheduling a flowline manufacturing cell with sequence dependent family setup times
• Selected Topics in Column Generation
• The Complexity of Flowshop and Jobshop Scheduling
• Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups

Cited in

(13)

• A hybrid metaheuristic approach for minimizing the total flow time in a flow shop sequence dependent group scheduling problem
• A new encoding scheme-based hybrid algorithm for minimising two-machine flow-shop group scheduling problem
• When serial batch scheduling involves parallel batching decisions: a branch and price scheme
• Energy-aware production scheduling in the flow shop environment under sequence-dependent setup times, group scheduling and renewable energy constraints
• Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates
• Scheduling jobs families with learning effect on the setup
• An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem
• Minimizing total completion time in the flexible flowshop 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
• A comprehensive review of flowshop group scheduling literature
• New effective MILP models for PFSPs arising from real applications
• The third comprehensive survey on scheduling problems with setup times/costs
• Group scheduling in a two-stage flowshop

Describes a project that uses

Uses Software

• CPLEX

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)