MP or not MP: that is the question
From MaRDI portal
Publication:283264
DOI10.1007/s10951-015-0459-4zbMath1341.90041OpenAlexW2196027431MaRDI QIDQ283264
Publication date: 13 May 2016
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-015-0459-4
Quadratic programming (90C20) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (2)
Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint ⋮ Optimizing the physician scheduling problem in a large hospital ward
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hybrid heuristic approach for single machine scheduling with release times
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem
- Mathematical programming formulations for machine scheduling: A survey
- Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances
- Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.
- Formulating logical implications in combinatorial optimisation
- Minimizing the weighted number of tardy jobs on a single machine
- Fast algorithms for max independent set
- Reoptimization in machine scheduling
- Fast neighborhood search for the single machine total weighted tardiness problem
- Multicriteria scheduling problems: a survey
- A measure & conquer approach for the analysis of exact algorithms
- Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed
- The Traveling Salesman Problem with Distances One and Two
- Techniques for scheduling with rejection
This page was built for publication: MP or not MP: that is the question
