For the airplane refueling problem local precedence implies global precedence
From MaRDI portal
Publication:2341094
DOI10.1007/s11590-014-0758-2zbMath1320.90037OpenAlexW1964099911MaRDI QIDQ2341094
Publication date: 23 April 2015
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-014-0758-2
Related Items (4)
The local-global conjecture for scheduling with non-linear cost ⋮ The TV advertisements scheduling problem ⋮ A novel MILP model for \(N\)-vehicle exploration problem ⋮ The single machine weighted mean squared deviation problem
Cites Work
- Unnamed Item
- Unnamed Item
- Decomposition in single-machine scheduling
- An improved precedence rule for single machine sequencing problems with quadratic penalty
- On the complexity of the single machine scheduling problem minimizing total weighted delay penalty
- On the Performance of Smith’s Rule in Single-Machine Scheduling with Nonlinear Cost
- Universal Sequencing on a Single Machine
- Note—A Node Elimination Procedure for Townsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem
- The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
- Order constraints for single machine scheduling with non-linear cost
- An experimental and analytical study of order constraints for single machine scheduling with quadratic cost
- Numerical Methods for Single Machine Scheduling with Non-linear Cost Functions to Minimize Total Cost
- Dual Techniques for Scheduling on a Machine with Varying Speed
This page was built for publication: For the airplane refueling problem local precedence implies global precedence
