Type-2 integrated process-planning and scheduling problem: reformulation and solution algorithms
From MaRDI portal
Publication:2146989
DOI10.1016/j.cor.2022.105728MaRDI QIDQ2146989
Mehmet A. Begen, Gregory S. Zaric, Bahman Naderi
Publication date: 22 June 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.105728
Benders decomposition; constraint programming; optimality cut; type-2 integrated process planning and scheduling problem
90Bxx: Operations research and management science
Uses Software
Cites Work
- Unnamed Item
- An object-coding genetic algorithm for integrated process planning and scheduling
- Mixed integer programming models for job shop scheduling: A computational analysis
- Mathematical modeling and evolutionary algorithm-based approach for integrated process planning and scheduling
- Logic-based Benders decomposition
- Job-shop scheduling with processing alternatives.
- A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling.
- IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
- A hybrid integer and constraint programming approach to solve nurse rostering problems
- Solving integrated process planning and scheduling problem with constructive meta-heuristics
- A hybrid constraint programming/mixed integer programming framework for the preventive signaling maintenance crew scheduling problem
- Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling
- Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems
- Exact optimization and decomposition approaches for shelf space allocation
- Logic-Based Decomposition Methods for the Travelling Purchaser Problem
- Scheduling Home Hospice Care with Logic-Based Benders Decomposition
- Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem
- A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling
- Logic-Based Benders Decomposition for Large-Scale Optimization
- Planning and Scheduling by Logic-Based Benders Decomposition
- An Algorithm for Solving the Job-Shop Problem
- Integration of process planning and scheduling by exploring the flexibility of process planning
- Mixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling
- Integrated process planning and scheduling/rescheduling—an agent-based approach
- Scheduling
