Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date
From MaRDI portal
Publication:2676340
Recommendations
- An exact framework for the discrete parallel machine scheduling location problem
- Discrete parallel machine makespan ScheLoc problem
- Solving scheduling and location problems in the plane simultaneously
- Novel formulations and logic-based Benders decomposition for the integrated parallel machine scheduling and location problem
- Coordinating multi-location production and customer delivery
Cites work
- A Benders decomposition-based framework for solving quay crane scheduling problems
- A Cutting Plane Algorithm for the Linear Ordering Problem
- A dynamic programming method for single machine scheduling
- A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
- A heuristic for BILP problems: the single source capacitated facility location problem
- A kernel search heuristic for a fair facility location problem
- A matheuristic algorithm for stochastic home health care planning
- A matheuristic for parallel machine scheduling with tool replacements
- A matheuristic solution approach for the production routing problem with visit spacing policy
- A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown and Repair
- A strong preemptive relaxation for weighted tardiness and earliness/tardiness problems on unrelated parallel machines
- A time indexed formulation of non-preemptive single machine scheduling problems
- Adaptive kernel search: a heuristic for solving mixed integer linear programs
- An exact algorithm for single-machine scheduling without machine idle time
- An exact algorithm for the precedence-constrained single-machine scheduling problem
- An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
- An exact framework for the discrete parallel machine scheduling location problem
- Analysis of a Local Search Heuristic for Facility Location Problems
- Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling
- Collaborative operating room planning and scheduling
- Discrete parallel machine makespan ScheLoc problem
- Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- scientific article; zbMATH DE number 3550186 (Why is no real title available?)
- scientific article; zbMATH DE number 2065615 (Why is no real title available?)
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Logic-based Benders decomposition
- Logic-based Benders decomposition for scheduling a batching machine
- Manufacturing lead-time rules: customer retention versus tardiness costs
- Minimizing the total weighted delivery time in container transportation scheduling
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
- Multi-warehouse package consolidation for split orders in online retailing
- Near-optimal solutions of large-scale single-machine scheduling problems
- Novel formulations and logic-based Benders decomposition for the integrated parallel machine scheduling and location problem
- On-line scheduling with delivery time on a single batch machine
- Order Assignment and Scheduling in a Supply Chain
- Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing
- Parallel machine scheduling, linear programming, and parameter list scheduling heuristics
- Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects
- Partitioning procedures for solving mixed-variables programming problems
- Robust absolute single machine makespan scheduling-location problem on trees
- Scheduling a production-distribution system to optimize the tradeoff between delivery tardiness and distribution cost
- Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time
- Scheduling on parallel identical machines to minimize total tardiness
- Scheduling under a common due-date on parallel unrelated machines
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem
- Solving scheduling and location problems in the plane simultaneously
- The flow shop scheduling polyhedron with setup times
- The two-echelon inventory-routing problem with fleet management
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
Cited in
(13)- An exact framework for the discrete parallel machine scheduling location problem
- scientific article; zbMATH DE number 1841981 (Why is no real title available?)
- Novel formulations and logic-based Benders decomposition for the integrated parallel machine scheduling and location problem
- A new and general stochastic parallel machine ScheLoc problem with limited location capacity and customer credit risk
- An integrated approach for allocation and scheduling-location problems on graphs
- Single machine scheduling problems with truncated learning effects and exponential past-sequence-dependent delivery times
- Logic-based benders decomposition for bi-objective parallel machine selection and job scheduling with release dates and resource consumption
- Single-machine common due-window assignment and scheduling with position-dependent weights, delivery time, learning effect and resource allocations
- Optimizing plastic product manufacturing scheduling: an integrated approach to minimize setup costs and tardiness with preventive maintenance considerations
- Meta-learning for dynamic multi-robot task scheduling
- Energy-efficient scheduling in an identical parallel machine environment with peak power consumption and deadline constraints
- Common due window assignment and single machine scheduling with delivery time, resource allocation, and job-dependent learning effect
- Single-machine online scheduling with non-delayed processing constraint and deterioration effect in the steel rolling process
This page was built for publication: Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2676340)
