A cutting plane approach for integrated planning and scheduling

DOI10.1016/J.COR.2011.04.006zbMATH Open1251.90158OpenAlexW1975608091MaRDI QIDQ1761978FDOQ1761978

András Kovács, Tamás Kis

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.04.006

Recommendations

• scientific article
• Constraint-propagation-based cutting planes: an application to the resource-constrained project scheduling problem
• Solving planning and scheduling problems with combined integer and constraint programming
• A cutting plane algorithm for a single machine scheduling problem
• A hybrid method for the planning and scheduling
• scientific article; zbMATH DE number 2080307
• Principles and Practice of Constraint Programming – CP 2004
• The application of preprocessing and cutting plane techniques for a class of production planning problems

zbMATH Keywords

mathematical programmingcutting planesparallel machine schedulingproduction planning and scheduling

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Logic-based Benders decomposition
• Sequence independent lifting in mixed integer programming
• Facets of the Knapsack Polytope From Minimal Covers
• Bounds on Multiprocessing Timing Anomalies
• An Application of Bin-Packing to Multiprocessor Scheduling
• The one-machine sequencing problem
• New classes of fast lower bounds for bin packing problems
• Detecting infeasibility and generating cuts for mixed integer programming using constraint programming
• Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates
• Algorithms for hybrid MILP/CP models for a class of optimization problems
• Valid Linear Inequalities for Fixed Charge Problems
• Lower bounds and reduction procedures for the bin packing problem
• Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound
• Cut generation for an integrated employee timetabling and production scheduling problem
• Monolithic vs. hierarchical balancing and scheduling of a flexible assembly line
• An Integrated Model for Job-Shop Planning and Scheduling
• An exact algorithm for the identical parallel machine scheduling problem.
• A Hybrid Algorithm for a Class of Resource Constrained Scheduling Problems

Cited In (9)

• Title not available (Why is that?)
• A rough-cut capacity planning model with overlapping
• The application of preprocessing and cutting plane techniques for a class of production planning problems
• MILP models for the optimization of real production lines
• A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports
• Sawing planning using a multicriteria approach
• A hybrid multi-objective approach for real-time flexible production scheduling and rescheduling under dynamic environment in Industry 4.0 context
• An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling
• An Integrated Model for Job-Shop Planning and Scheduling

This page was built for publication: A cutting plane approach for integrated planning and scheduling

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