A combined CLP-MILP approach for scheduling commodities in a pipeline

DOI10.1007/s10951-010-0186-9zbMath1208.90074OpenAlexW2018310120MaRDI QIDQ633547

Flávio jun. Neves, Leandro Magatão, Lúcia V. R. Arruda

Publication date: 1 April 2011

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-010-0186-9

zbMATH Keywords

schedulingmixed integer linear programming (MILP)pipelineconstraint logic programming (CLP)

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (3)

Planning of multi-product pipelines by economic lot scheduling models ⋮ A mixed-integer linear programming for scheduling a multi-product pipeline with dual-purpose terminals ⋮ An efficient GRASP-like algorithm for the multi-product straight pipeline scheduling problem

Cites Work

• A survey of constraint-based programming paradigms
• An integrated method for planning and scheduling to minimize tardiness
• Logic applied to integer programming and integer programming applied to logic
• Tools for reformulating logical forms into zero-one mixed integer programs
• On solving the progressive party problem as a MIP.
• Connections Between Integer Linear Programming and Constraint Logic Programming—An Overview and Introduction to the Cluster of Articles
• Search and strategies in OPL
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A combined CLP-MILP approach for scheduling commodities in a pipeline