Heuristic solution algorithm for routing flow shop with buffers and ready times

DOI10.1007/978-3-319-01857-7_52MaRDI QIDQ2950463zbMATH OpenOpenAlexFDO

Authors Jerzy Józefczyk, Michał Markowski

Publication date 9 October 2015

Published in Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-01857-7_52

zbMATH Keywords

optimizationroutingflow shopcomputer simulationheuristic algorithms

Mathematics Subject Classification ID

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

Recommendations

• A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems
• Flow shop with job-dependent buffer requirements -- a polynomial-time algorithm and efficient heuristics
• Flow-shop problems with intermediate buffers
• Routing Two-Machine Flowshop Problems on Networks with Special Structure
• A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes

Cited in

(2)

• A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems
• An exact solution with an improved running time for the routing flow shop problem with two machines

This page was built for publication: Heuristic solution algorithm for routing flow shop with buffers and ready times

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