A branch and bound based heuristic for multi-product resource constrained scheduling problem in FMS environment

DOI10.1016/S0377-2217(97)00433-5zbMath0933.90030MaRDI QIDQ1806642

Bimal K. Modi, Kripa Shanker

Publication date: 8 November 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

branch and boundflexible manufacturing system0-1 integer linear programmingresource flexibilitymultiple-product resource-constrained scheduling

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)

Related Items (2)

Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP) ⋮ Scheduling flexible manufacturing cells using Tabu Search

Cites Work

• A multiobjective, multi-level heuristic for dynamic resource constrained scheduling problems
• Solving a bicriterion scheduling problem

This page was built for publication: A branch and bound based heuristic for multi-product resource constrained scheduling problem in FMS environment