Minimizing makespan in re-entrant permutation flow-shops

DOI10.1057/PALGRAVE.JORS.2601556MaRDI QIDQ4661115zbMATH OpenOpenAlexFDO

Authors Jason Chao-Hsien Pan, Jen-Shiang Chen

Publication date 4 April 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2601556

zbMATH Keywords

heuristicsmixed binary integer programmingre-entrant permutation flow-shopsscheduling

Mathematics Subject Classification ID

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

Recommendations

• Minimizing makespan on an \(m\)-machine re-entrant flowshop
• Minimizing makespan on a two-machine re-entrant flowshop
• Heuristic algorithms for two machine re-entrant flow shop
• Minimizing total completion time for re-entrant flow shop scheduling problems
• Flow shops with reentry: reversibility properties and makespan optimal schedules

Cited in

(16)

• Minimizing total tardiness on a two-machine re-entrant flowshop
• Re-entrant flowshop scheduling with learning considerations to minimize the makespan
• Flow shops with reentry: reversibility properties and makespan optimal schedules
• Minimizing makespan on an \(m\)-machine re-entrant flowshop
• Multi-family scheduling in a two-machine reentrant flow shop with setups
• Mixed binary integer programming formulations for the reentrant job shop scheduling problem
• An iterated local search for a re-entrant flow shop scheduling problem
• Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times
• Mean Flow Time Minimization in Reentrant Job Shops with a Hub
• Minimizing makespan on a two-machine re-entrant flowshop
• Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop
• Minimizing total completion time for re-entrant flow shop scheduling problems
• Makespan minimization in reentrant flow shop problem with identical jobs
• Robust scheduling in a two-machine re-entrant flow shop to minimise the value-at-risk of the makespan: branch-and-bound and heuristic algorithms based on Markovian activity networks and phase-type distributions
• Flow shops with reentry: the total weighted completion time objective
• Heuristic algorithms for two machine re-entrant flow shop

This page was built for publication: Minimizing makespan in re-entrant permutation flow-shops

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4661115)