Mixed integer programming formulations for the biomass truck scheduling problem
From MaRDI portal
Publication:2358168
DOI10.1007/s10100-015-0395-6zbMath1364.90164OpenAlexW1982341555MaRDI QIDQ2358168
László Torjai, Ferenc Kruzslicz
Publication date: 21 June 2017
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-015-0395-6
parallel machinessingle servertruck schedulingresource availability costbiomass logisticsresource network flow
Related Items (3)
A multilayer model predictive control methodology applied to a biomass supply chain operational level ⋮ Multiprofessor scheduling ⋮ General variable neighborhood search for the parallel machine scheduling problem with two common servers
Cites Work
- Unnamed Item
- The concrete delivery problem
- Event-based MILP models for resource-constrained project scheduling problems
- Robust optimization models for project scheduling with resource availability cost
- Parallel machine scheduling problems with a single server
- An exact algorithm for minimizing resource availability costs in project scheduling
- Parallel machine scheduling with multiple unloading servers
- Insertion techniques for static and dynamic resource-constrained project scheduling.
- Parallel machine scheduling with a common server
- A branch-and-price algorithm for the general case of scheduling parallel machines with a single server
- MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server
- Complexity results for parallel machine problems with a single server
- Equal processing and equal setup time cases of scheduling parallel machines with a single server
- Total completion time minimization in a computer system with a server and two parallel processors
- Mixed-integer linear programming for resource leveling problems
- Solving the resource availability cost problem in project scheduling by path relinking and genetic algorithm
- Scheduling two parallel semiautomatic machines to minimize machine interference
- Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time
- OR PRACTICE—The Dance of the Thirty-Ton Trucks: Dispatching and Scheduling in a Dynamic Environment
- Minimizing Resource Availability Costs in Time-Limited Project Networks
- Scheduling parallel machines with a single server: Some solvable cases and heuristics
This page was built for publication: Mixed integer programming formulations for the biomass truck scheduling problem