An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer

DOI<141::AID-NAV2>3.0.CO;2-8 10.1002/(SICI)1520-6750(199803)45:2<141::AID-NAV2>3.0.CO;2-8zbMath0903.90096OpenAlexW2027725385MaRDI QIDQ4390594

Fabrizio Rossi, G. Gristina, Alessandro Agnetis

Publication date: 26 May 1998

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199803)45:2<141::aid-nav2>3.0.co;2-8

zbMATH Keywords

flow shopmakespan minimizationtwo machinesexact branch-and-bound

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Optimal versus heuristic scheduling of surface mount technology lines ⋮ An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers. ⋮ An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers ⋮ An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers ⋮ Batch scheduling in the no-wait two-machine flowshop to minimize the makespan ⋮ A TWO-STAGE FLOWSHOP SCHEDULING WITH LIMITED BUFFER STORAGE