A two pass heuristic algorithm for scheduling `blocked out' units in continuous process industry

DOI10.1007/s10479-007-0265-2zbMath1152.90427OpenAlexW1991518723MaRDI QIDQ940895

Subir Bhattacharya, Sumit Kumar Bose

Publication date: 3 September 2008

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-007-0265-2

zbMATH Keywords

heuristic searchcontinuous processingdepth first branch and boundprocess scheduling

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Mixed integer linear programming in process scheduling: modeling, algorithms, and applications
• Assignment and sequencing models for the scheduling of process systems
• Redefining event variables for efficient modeling of continuous-time batch processing
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: A two pass heuristic algorithm for scheduling `blocked out' units in continuous process industry