A cutting plane approach for integrated planning and scheduling

DOI10.1016/j.cor.2011.04.006zbMath1251.90158OpenAlexW1975608091MaRDI QIDQ1761978

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

zbMATH Keywords

mathematical programmingcutting planesparallel machine schedulingproduction planning and scheduling

Mathematics Subject Classification ID

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

Related Items (5)

A rough-cut capacity planning model with overlapping ⋮ MILP models for the optimization of real production lines ⋮ An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling ⋮ A hybrid multi-objective approach for real-time flexible production scheduling and rescheduling under dynamic environment in Industry 4.0 context ⋮ A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports

Cites Work

• Unnamed Item
• 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
• The one-machine sequencing problem
• Logic-based Benders decomposition
• An exact algorithm for the identical parallel machine scheduling problem.
• Monolithic vs. hierarchical balancing and scheduling of a flexible assembly line
• Sequence independent lifting in mixed integer programming
• Detecting infeasibility and generating cuts for mixed integer programming using constraint programming
• Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
• Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates
• Valid Linear Inequalities for Fixed Charge Problems
• An Integrated Model for Job-Shop Planning and Scheduling
• An Application of Bin-Packing to Multiprocessor Scheduling
• Facets of the Knapsack Polytope From Minimal Covers
• A Hybrid Algorithm for a Class of Resource Constrained Scheduling Problems
• Bounds on Multiprocessing Timing Anomalies
• New classes of fast lower bounds for bin packing problems

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