Robust parallel machine selection and scheduling with uncertain release times
From MaRDI portal
Cites work
- A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach
- A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions
- A distributionally robust approach for the parallel machine scheduling problem with optional machines and job tardiness
- A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
- A multicriteria heuristic method to improve resource allocation in multiproject scheduling
- A relax-and-repair heuristic for the swap-body vehicle routing problem
- A survey of adjustable robust optimization
- Adjustable robust optimization with objective uncertainty
- An adaptive robust optimization model for parallel machine scheduling
- An efficient relax-and-solve method for the multi-mode resource constrained project scheduling problem
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Combinatorial Benders' cuts for the strip packing problem
- Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems
- Flowshop scheduling with learning effect and job rejection
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- Hybrid flow shop scheduling with not-all-machines options via local search with controlled deterioration
- Logic-based Benders decomposition
- Logic-Based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling
- Logic-based Benders decomposition for large-scale optimization
- Logic-based Benders decomposition for scheduling a batching machine
- Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect
- Minimizing the number of machines for minimum length schedules
- Minimizing the number of machines for scheduling jobs with equal processing times
- Novel formulations and logic-based Benders decomposition for the integrated parallel machine scheduling and location problem
- Optimisation model for multi-item multi-echelon supply chains with nested multi-level products
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Oracle-based algorithms for binary two-stage robust optimization
- Order assignment and scheduling under processing and distribution time uncertainty
- Parallel Machine Scheduling: Impact of Adding Extra Machines
- Parallel machine selection and job scheduling to minimize machine cost and job tardiness
- Partitioning procedures for solving mixed-variables programming problems
- Planning and Scheduling by Logic-Based Benders Decomposition
- Robust scheduling with logic-based Benders decomposition
- Scheduling unrelated parallel machines with optional machines and jobs selection
- Single machine scheduling with release dates: a distributionally robust approach
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Stochastic planning and scheduling with logic-based Benders decomposition
- The Benders decomposition algorithm: a literature review
- The optimal number of used machines in a two-stage flexible flowshop scheduling problem
- The Price of Robustness
- Two-stage robust optimization approach to elective surgery and downstream capacity planning
This page was built for publication: Robust parallel machine selection and scheduling with uncertain release times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6869785)
